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/Problem11_label11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 18:17:24,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 18:17:24,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 18:17:24,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 18:17:24,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 18:17:24,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 18:17:24,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 18:17:24,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 18:17:24,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 18:17:24,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 18:17:24,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 18:17:24,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 18:17:24,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 18:17:24,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 18:17:24,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 18:17:24,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 18:17:24,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 18:17:24,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 18:17:24,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 18:17:24,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 18:17:24,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 18:17:24,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 18:17:24,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 18:17:24,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 18:17:24,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 18:17:24,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 18:17:24,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 18:17:24,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 18:17:24,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 18:17:24,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 18:17:24,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 18:17:24,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 18:17:24,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 18:17:24,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 18:17:24,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 18:17:24,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 18:17:24,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 18:17:24,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 18:17:24,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 18:17:24,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 18:17:24,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 18:17:24,412 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 18:17:24,453 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 18:17:24,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 18:17:24,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 18:17:24,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 18:17:24,458 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 18:17:24,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 18:17:24,459 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 18:17:24,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 18:17:24,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 18:17:24,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 18:17:24,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 18:17:24,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 18:17:24,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 18:17:24,463 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 18:17:24,463 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 18:17:24,464 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 18:17:24,464 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 18:17:24,464 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 18:17:24,464 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 18:17:24,464 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 18:17:24,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 18:17:24,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 18:17:24,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 18:17:24,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 18:17:24,469 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 18:17:24,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 18:17:24,469 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 18:17:24,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 18:17:24,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 18:17:24,507 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 18:17:24,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 18:17:24,524 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 18:17:24,526 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 18:17:24,526 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 18:17:24,527 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label11.c [2019-09-07 18:17:24,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b5f0de3/0e6afbd80ffc4b3d876cdd9009685614/FLAG42e6e0f25 [2019-09-07 18:17:25,295 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 18:17:25,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label11.c [2019-09-07 18:17:25,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b5f0de3/0e6afbd80ffc4b3d876cdd9009685614/FLAG42e6e0f25 [2019-09-07 18:17:25,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b5f0de3/0e6afbd80ffc4b3d876cdd9009685614 [2019-09-07 18:17:25,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 18:17:25,489 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 18:17:25,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 18:17:25,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 18:17:25,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 18:17:25,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:17:25" (1/1) ... [2019-09-07 18:17:25,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf494db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:17:25, skipping insertion in model container [2019-09-07 18:17:25,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:17:25" (1/1) ... [2019-09-07 18:17:25,509 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 18:17:25,597 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 18:17:26,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:17:26,325 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 18:17:26,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:17:26,605 INFO L192 MainTranslator]: Completed translation [2019-09-07 18:17:26,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:17:26 WrapperNode [2019-09-07 18:17:26,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 18:17:26,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 18:17:26,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 18:17:26,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 18:17:26,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:17:26" (1/1) ... [2019-09-07 18:17:26,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:17:26" (1/1) ... [2019-09-07 18:17:26,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:17:26" (1/1) ... [2019-09-07 18:17:26,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:17:26" (1/1) ... [2019-09-07 18:17:26,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:17:26" (1/1) ... [2019-09-07 18:17:26,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:17:26" (1/1) ... [2019-09-07 18:17:26,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:17:26" (1/1) ... [2019-09-07 18:17:26,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 18:17:26,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 18:17:26,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 18:17:26,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 18:17:26,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:17:26" (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 18:17:26,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 18:17:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 18:17:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 18:17:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 18:17:26,910 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 18:17:26,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 18:17:26,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 18:17:26,910 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 18:17:26,911 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 18:17:26,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 18:17:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 18:17:29,030 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 18:17:29,030 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 18:17:29,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:17:29 BoogieIcfgContainer [2019-09-07 18:17:29,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 18:17:29,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 18:17:29,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 18:17:29,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 18:17:29,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 06:17:25" (1/3) ... [2019-09-07 18:17:29,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d72ff45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:17:29, skipping insertion in model container [2019-09-07 18:17:29,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:17:26" (2/3) ... [2019-09-07 18:17:29,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d72ff45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:17:29, skipping insertion in model container [2019-09-07 18:17:29,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:17:29" (3/3) ... [2019-09-07 18:17:29,043 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label11.c [2019-09-07 18:17:29,058 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 18:17:29,071 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 18:17:29,094 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 18:17:29,152 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 18:17:29,153 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 18:17:29,154 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 18:17:29,154 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 18:17:29,154 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 18:17:29,154 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 18:17:29,154 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 18:17:29,154 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 18:17:29,155 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 18:17:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-09-07 18:17:29,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 18:17:29,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:17:29,207 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:17:29,209 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:17:29,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:17:29,215 INFO L82 PathProgramCache]: Analyzing trace with hash -573919190, now seen corresponding path program 1 times [2019-09-07 18:17:29,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:17:29,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:17:29,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:29,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:29,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:17:29,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:17:29,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 18:17:29,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 18:17:29,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 18:17:29,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:17:29,717 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 3 states. [2019-09-07 18:17:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:17:31,328 INFO L93 Difference]: Finished difference Result 779 states and 1369 transitions. [2019-09-07 18:17:31,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 18:17:31,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-07 18:17:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:17:31,349 INFO L225 Difference]: With dead ends: 779 [2019-09-07 18:17:31,350 INFO L226 Difference]: Without dead ends: 425 [2019-09-07 18:17:31,358 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 18:17:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-09-07 18:17:31,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 420. [2019-09-07 18:17:31,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-09-07 18:17:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 672 transitions. [2019-09-07 18:17:31,451 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 672 transitions. Word has length 67 [2019-09-07 18:17:31,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:17:31,452 INFO L475 AbstractCegarLoop]: Abstraction has 420 states and 672 transitions. [2019-09-07 18:17:31,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 18:17:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 672 transitions. [2019-09-07 18:17:31,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-07 18:17:31,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:17:31,459 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:17:31,460 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:17:31,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:17:31,460 INFO L82 PathProgramCache]: Analyzing trace with hash -391265842, now seen corresponding path program 1 times [2019-09-07 18:17:31,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:17:31,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:17:31,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:31,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:31,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:17:31,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:17:31,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:17:31,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:17:31,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:17:31,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:17:31,651 INFO L87 Difference]: Start difference. First operand 420 states and 672 transitions. Second operand 4 states. [2019-09-07 18:17:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:17:33,530 INFO L93 Difference]: Finished difference Result 1603 states and 2614 transitions. [2019-09-07 18:17:33,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:17:33,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-07 18:17:33,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:17:33,542 INFO L225 Difference]: With dead ends: 1603 [2019-09-07 18:17:33,542 INFO L226 Difference]: Without dead ends: 1189 [2019-09-07 18:17:33,546 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 18:17:33,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-09-07 18:17:33,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 616. [2019-09-07 18:17:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-07 18:17:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 938 transitions. [2019-09-07 18:17:33,625 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 938 transitions. Word has length 141 [2019-09-07 18:17:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:17:33,628 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 938 transitions. [2019-09-07 18:17:33,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:17:33,628 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 938 transitions. [2019-09-07 18:17:33,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-07 18:17:33,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:17:33,639 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:17:33,640 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:17:33,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:17:33,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1913186172, now seen corresponding path program 1 times [2019-09-07 18:17:33,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:17:33,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:17:33,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:33,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:33,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:17:33,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:17:33,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:17:33,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:17:33,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:17:33,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:17:33,945 INFO L87 Difference]: Start difference. First operand 616 states and 938 transitions. Second operand 6 states. [2019-09-07 18:17:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:17:35,621 INFO L93 Difference]: Finished difference Result 1448 states and 2185 transitions. [2019-09-07 18:17:35,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 18:17:35,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 169 [2019-09-07 18:17:35,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:17:35,631 INFO L225 Difference]: With dead ends: 1448 [2019-09-07 18:17:35,631 INFO L226 Difference]: Without dead ends: 838 [2019-09-07 18:17:35,634 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 18:17:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-09-07 18:17:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 827. [2019-09-07 18:17:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-09-07 18:17:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1209 transitions. [2019-09-07 18:17:35,687 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1209 transitions. Word has length 169 [2019-09-07 18:17:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:17:35,688 INFO L475 AbstractCegarLoop]: Abstraction has 827 states and 1209 transitions. [2019-09-07 18:17:35,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:17:35,691 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1209 transitions. [2019-09-07 18:17:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-07 18:17:35,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:17:35,695 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 18:17:35,696 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:17:35,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:17:35,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1478588639, now seen corresponding path program 1 times [2019-09-07 18:17:35,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:17:35,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:17:35,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:35,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:35,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 120 proven. 76 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 18:17:35,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:17:35,885 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:17:35,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:36,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 18:17:36,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:17:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:17:36,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:17:36,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2019-09-07 18:17:36,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 18:17:36,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 18:17:36,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-07 18:17:36,170 INFO L87 Difference]: Start difference. First operand 827 states and 1209 transitions. Second operand 8 states. [2019-09-07 18:17:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:17:38,086 INFO L93 Difference]: Finished difference Result 2476 states and 3705 transitions. [2019-09-07 18:17:38,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 18:17:38,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 232 [2019-09-07 18:17:38,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:17:38,102 INFO L225 Difference]: With dead ends: 2476 [2019-09-07 18:17:38,102 INFO L226 Difference]: Without dead ends: 1655 [2019-09-07 18:17:38,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-09-07 18:17:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2019-09-07 18:17:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1434. [2019-09-07 18:17:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-09-07 18:17:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1970 transitions. [2019-09-07 18:17:38,185 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1970 transitions. Word has length 232 [2019-09-07 18:17:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:17:38,185 INFO L475 AbstractCegarLoop]: Abstraction has 1434 states and 1970 transitions. [2019-09-07 18:17:38,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 18:17:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1970 transitions. [2019-09-07 18:17:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-07 18:17:38,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:17:38,192 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:17:38,192 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:17:38,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:17:38,192 INFO L82 PathProgramCache]: Analyzing trace with hash -846076860, now seen corresponding path program 1 times [2019-09-07 18:17:38,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:17:38,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:17:38,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:38,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:38,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:38,402 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 120 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 18:17:38,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:17:38,403 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 18:17:38,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:38,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 18:17:38,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:17:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-07 18:17:38,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:17:38,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 18:17:38,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:17:38,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:17:38,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:17:38,623 INFO L87 Difference]: Start difference. First operand 1434 states and 1970 transitions. Second operand 9 states. [2019-09-07 18:17:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:17:41,372 INFO L93 Difference]: Finished difference Result 5090 states and 7412 transitions. [2019-09-07 18:17:41,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 18:17:41,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 241 [2019-09-07 18:17:41,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:17:41,403 INFO L225 Difference]: With dead ends: 5090 [2019-09-07 18:17:41,403 INFO L226 Difference]: Without dead ends: 3662 [2019-09-07 18:17:41,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:17:41,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2019-09-07 18:17:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3599. [2019-09-07 18:17:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2019-09-07 18:17:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 4909 transitions. [2019-09-07 18:17:41,565 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 4909 transitions. Word has length 241 [2019-09-07 18:17:41,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:17:41,565 INFO L475 AbstractCegarLoop]: Abstraction has 3599 states and 4909 transitions. [2019-09-07 18:17:41,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:17:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 4909 transitions. [2019-09-07 18:17:41,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-07 18:17:41,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:17:41,574 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:17:41,574 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:17:41,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:17:41,574 INFO L82 PathProgramCache]: Analyzing trace with hash -634339917, now seen corresponding path program 1 times [2019-09-07 18:17:41,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:17:41,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:17:41,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:41,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:41,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:17:41,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:17:41,841 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 18:17:41,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:41,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:17:41,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:17:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:17:41,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:17:41,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 18:17:41,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 18:17:41,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 18:17:41,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-07 18:17:41,998 INFO L87 Difference]: Start difference. First operand 3599 states and 4909 transitions. Second operand 7 states. [2019-09-07 18:17:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:17:43,432 INFO L93 Difference]: Finished difference Result 8976 states and 12962 transitions. [2019-09-07 18:17:43,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:17:43,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 242 [2019-09-07 18:17:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:17:43,465 INFO L225 Difference]: With dead ends: 8976 [2019-09-07 18:17:43,465 INFO L226 Difference]: Without dead ends: 5571 [2019-09-07 18:17:43,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:17:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5571 states. [2019-09-07 18:17:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5571 to 5514. [2019-09-07 18:17:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5514 states. [2019-09-07 18:17:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 7254 transitions. [2019-09-07 18:17:43,656 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 7254 transitions. Word has length 242 [2019-09-07 18:17:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:17:43,657 INFO L475 AbstractCegarLoop]: Abstraction has 5514 states and 7254 transitions. [2019-09-07 18:17:43,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 18:17:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 7254 transitions. [2019-09-07 18:17:43,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-07 18:17:43,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:17:43,675 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:17:43,675 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:17:43,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:17:43,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1709983001, now seen corresponding path program 1 times [2019-09-07 18:17:43,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:17:43,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:17:43,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:43,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:43,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-07 18:17:43,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:17:43,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 18:17:43,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 18:17:43,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 18:17:43,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:17:43,929 INFO L87 Difference]: Start difference. First operand 5514 states and 7254 transitions. Second operand 3 states. [2019-09-07 18:17:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:17:44,847 INFO L93 Difference]: Finished difference Result 10834 states and 14293 transitions. [2019-09-07 18:17:44,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 18:17:44,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-09-07 18:17:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:17:44,870 INFO L225 Difference]: With dead ends: 10834 [2019-09-07 18:17:44,870 INFO L226 Difference]: Without dead ends: 5514 [2019-09-07 18:17:44,884 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 18:17:44,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5514 states. [2019-09-07 18:17:45,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5514 to 5324. [2019-09-07 18:17:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5324 states. [2019-09-07 18:17:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5324 states to 5324 states and 6631 transitions. [2019-09-07 18:17:45,029 INFO L78 Accepts]: Start accepts. Automaton has 5324 states and 6631 transitions. Word has length 283 [2019-09-07 18:17:45,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:17:45,030 INFO L475 AbstractCegarLoop]: Abstraction has 5324 states and 6631 transitions. [2019-09-07 18:17:45,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 18:17:45,030 INFO L276 IsEmpty]: Start isEmpty. Operand 5324 states and 6631 transitions. [2019-09-07 18:17:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-07 18:17:45,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:17:45,042 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:17:45,043 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:17:45,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:17:45,043 INFO L82 PathProgramCache]: Analyzing trace with hash -273543866, now seen corresponding path program 1 times [2019-09-07 18:17:45,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:17:45,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:17:45,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:45,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:45,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-07 18:17:45,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:17:45,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 18:17:45,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 18:17:45,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 18:17:45,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:17:45,300 INFO L87 Difference]: Start difference. First operand 5324 states and 6631 transitions. Second operand 3 states. [2019-09-07 18:17:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:17:46,483 INFO L93 Difference]: Finished difference Result 12924 states and 16376 transitions. [2019-09-07 18:17:46,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 18:17:46,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-09-07 18:17:46,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:17:46,527 INFO L225 Difference]: With dead ends: 12924 [2019-09-07 18:17:46,527 INFO L226 Difference]: Without dead ends: 7794 [2019-09-07 18:17:46,540 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 18:17:46,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7794 states. [2019-09-07 18:17:46,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7794 to 7604. [2019-09-07 18:17:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7604 states. [2019-09-07 18:17:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7604 states to 7604 states and 9475 transitions. [2019-09-07 18:17:46,724 INFO L78 Accepts]: Start accepts. Automaton has 7604 states and 9475 transitions. Word has length 288 [2019-09-07 18:17:46,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:17:46,725 INFO L475 AbstractCegarLoop]: Abstraction has 7604 states and 9475 transitions. [2019-09-07 18:17:46,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 18:17:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 7604 states and 9475 transitions. [2019-09-07 18:17:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-07 18:17:46,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:17:46,736 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:17:46,736 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:17:46,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:17:46,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1118294579, now seen corresponding path program 1 times [2019-09-07 18:17:46,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:17:46,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:17:46,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:46,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:46,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 18:17:47,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:17:47,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:17:47,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:47,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:17:47,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:17:47,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:17:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 224 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:17:47,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:17:47,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-09-07 18:17:47,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 18:17:47,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 18:17:47,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-07 18:17:47,334 INFO L87 Difference]: Start difference. First operand 7604 states and 9475 transitions. Second operand 12 states. [2019-09-07 18:17:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:17:56,592 INFO L93 Difference]: Finished difference Result 24313 states and 32543 transitions. [2019-09-07 18:17:56,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-07 18:17:56,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 304 [2019-09-07 18:17:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:17:56,655 INFO L225 Difference]: With dead ends: 24313 [2019-09-07 18:17:56,655 INFO L226 Difference]: Without dead ends: 16903 [2019-09-07 18:17:56,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2116 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1010, Invalid=4842, Unknown=0, NotChecked=0, Total=5852 [2019-09-07 18:17:56,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16903 states. [2019-09-07 18:17:57,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16903 to 16493. [2019-09-07 18:17:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16493 states. [2019-09-07 18:17:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16493 states to 16493 states and 20901 transitions. [2019-09-07 18:17:57,049 INFO L78 Accepts]: Start accepts. Automaton has 16493 states and 20901 transitions. Word has length 304 [2019-09-07 18:17:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:17:57,050 INFO L475 AbstractCegarLoop]: Abstraction has 16493 states and 20901 transitions. [2019-09-07 18:17:57,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 18:17:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 16493 states and 20901 transitions. [2019-09-07 18:17:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-07 18:17:57,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:17:57,071 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:17:57,071 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:17:57,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:17:57,071 INFO L82 PathProgramCache]: Analyzing trace with hash -462762021, now seen corresponding path program 1 times [2019-09-07 18:17:57,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:17:57,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:17:57,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:57,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:57,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 124 proven. 106 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 18:17:57,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:17:57,414 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 18:17:57,428 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 18:17:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:57,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:17:57,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:17:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 124 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-07 18:17:57,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:17:57,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-09-07 18:17:57,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 18:17:57,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 18:17:57,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-07 18:17:57,617 INFO L87 Difference]: Start difference. First operand 16493 states and 20901 transitions. Second operand 10 states. [2019-09-07 18:18:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:01,854 INFO L93 Difference]: Finished difference Result 45100 states and 63581 transitions. [2019-09-07 18:18:01,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 18:18:01,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 312 [2019-09-07 18:18:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:02,001 INFO L225 Difference]: With dead ends: 45100 [2019-09-07 18:18:02,001 INFO L226 Difference]: Without dead ends: 28991 [2019-09-07 18:18:02,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 18:18:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28991 states. [2019-09-07 18:18:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28991 to 28303. [2019-09-07 18:18:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28303 states. [2019-09-07 18:18:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28303 states to 28303 states and 36865 transitions. [2019-09-07 18:18:03,580 INFO L78 Accepts]: Start accepts. Automaton has 28303 states and 36865 transitions. Word has length 312 [2019-09-07 18:18:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:03,581 INFO L475 AbstractCegarLoop]: Abstraction has 28303 states and 36865 transitions. [2019-09-07 18:18:03,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 18:18:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 28303 states and 36865 transitions. [2019-09-07 18:18:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-07 18:18:03,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:03,612 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 18:18:03,612 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:03,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:03,613 INFO L82 PathProgramCache]: Analyzing trace with hash -167960797, now seen corresponding path program 1 times [2019-09-07 18:18:03,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:03,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:03,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:03,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:03,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 256 proven. 86 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-07 18:18:03,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:18:03,913 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 18:18:03,937 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 18:18:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:04,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 18:18:04,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:18:04,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:18:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-09-07 18:18:04,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:18:04,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 18:18:04,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:18:04,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:18:04,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:18:04,221 INFO L87 Difference]: Start difference. First operand 28303 states and 36865 transitions. Second operand 9 states. [2019-09-07 18:18:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:08,522 INFO L93 Difference]: Finished difference Result 58185 states and 76090 transitions. [2019-09-07 18:18:08,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 18:18:08,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 341 [2019-09-07 18:18:08,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:08,624 INFO L225 Difference]: With dead ends: 58185 [2019-09-07 18:18:08,624 INFO L226 Difference]: Without dead ends: 33346 [2019-09-07 18:18:08,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-09-07 18:18:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33346 states. [2019-09-07 18:18:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33346 to 31564. [2019-09-07 18:18:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31564 states. [2019-09-07 18:18:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31564 states to 31564 states and 40710 transitions. [2019-09-07 18:18:09,477 INFO L78 Accepts]: Start accepts. Automaton has 31564 states and 40710 transitions. Word has length 341 [2019-09-07 18:18:09,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:09,478 INFO L475 AbstractCegarLoop]: Abstraction has 31564 states and 40710 transitions. [2019-09-07 18:18:09,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:18:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 31564 states and 40710 transitions. [2019-09-07 18:18:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-07 18:18:09,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:09,523 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 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 18:18:09,523 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:09,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:09,524 INFO L82 PathProgramCache]: Analyzing trace with hash -614886119, now seen corresponding path program 1 times [2019-09-07 18:18:09,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:09,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:09,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:09,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 189 proven. 6 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-09-07 18:18:09,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:18:09,943 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 18:18:09,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:10,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:18:10,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:18:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 379 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-07 18:18:10,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:18:10,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 18:18:10,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 18:18:10,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 18:18:10,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-07 18:18:10,216 INFO L87 Difference]: Start difference. First operand 31564 states and 40710 transitions. Second operand 11 states. [2019-09-07 18:18:18,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:18,068 INFO L93 Difference]: Finished difference Result 67741 states and 88422 transitions. [2019-09-07 18:18:18,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 18:18:18,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 393 [2019-09-07 18:18:18,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:18,187 INFO L225 Difference]: With dead ends: 67741 [2019-09-07 18:18:18,187 INFO L226 Difference]: Without dead ends: 36561 [2019-09-07 18:18:18,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=540, Invalid=3120, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 18:18:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36561 states. [2019-09-07 18:18:18,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36561 to 33322. [2019-09-07 18:18:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33322 states. [2019-09-07 18:18:18,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33322 states to 33322 states and 41545 transitions. [2019-09-07 18:18:18,914 INFO L78 Accepts]: Start accepts. Automaton has 33322 states and 41545 transitions. Word has length 393 [2019-09-07 18:18:18,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:18,915 INFO L475 AbstractCegarLoop]: Abstraction has 33322 states and 41545 transitions. [2019-09-07 18:18:18,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 18:18:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 33322 states and 41545 transitions. [2019-09-07 18:18:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-09-07 18:18:18,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:18,944 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:18:18,945 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:18,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1533666754, now seen corresponding path program 1 times [2019-09-07 18:18:18,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:18,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:18,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:18,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:18,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 289 proven. 107 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-07 18:18:19,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:18:19,228 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 18:18:19,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:19,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:18:19,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:18:19,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:18:19,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:18:20,795 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 339 proven. 106 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-07 18:18:20,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:18:20,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 9 [2019-09-07 18:18:20,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:18:20,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:18:20,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=53, Unknown=1, NotChecked=0, Total=72 [2019-09-07 18:18:20,803 INFO L87 Difference]: Start difference. First operand 33322 states and 41545 transitions. Second operand 9 states. [2019-09-07 18:19:23,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:23,621 INFO L93 Difference]: Finished difference Result 76526 states and 100672 transitions. [2019-09-07 18:19:23,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 18:19:23,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 419 [2019-09-07 18:19:23,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:23,780 INFO L225 Difference]: With dead ends: 76526 [2019-09-07 18:19:23,780 INFO L226 Difference]: Without dead ends: 43588 [2019-09-07 18:19:23,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 429 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=130, Invalid=370, Unknown=6, NotChecked=0, Total=506 [2019-09-07 18:19:23,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43588 states. [2019-09-07 18:19:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43588 to 41893. [2019-09-07 18:19:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41893 states. [2019-09-07 18:19:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41893 states to 41893 states and 51902 transitions. [2019-09-07 18:19:24,886 INFO L78 Accepts]: Start accepts. Automaton has 41893 states and 51902 transitions. Word has length 419 [2019-09-07 18:19:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:24,887 INFO L475 AbstractCegarLoop]: Abstraction has 41893 states and 51902 transitions. [2019-09-07 18:19:24,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:19:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 41893 states and 51902 transitions. [2019-09-07 18:19:24,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2019-09-07 18:19:24,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:24,970 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:19:24,971 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:24,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:24,971 INFO L82 PathProgramCache]: Analyzing trace with hash 431256130, now seen corresponding path program 1 times [2019-09-07 18:19:24,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:24,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:24,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 458 proven. 130 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-09-07 18:19:26,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:26,849 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 18:19:26,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:26,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:19:27,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:27,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 717 proven. 2 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:19:27,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:19:27,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 18:19:27,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 18:19:27,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 18:19:27,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:19:27,277 INFO L87 Difference]: Start difference. First operand 41893 states and 51902 transitions. Second operand 15 states. [2019-09-07 18:19:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:33,125 INFO L93 Difference]: Finished difference Result 82091 states and 102586 transitions. [2019-09-07 18:19:33,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 18:19:33,125 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 535 [2019-09-07 18:19:33,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:33,213 INFO L225 Difference]: With dead ends: 82091 [2019-09-07 18:19:33,214 INFO L226 Difference]: Without dead ends: 39774 [2019-09-07 18:19:33,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 568 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=502, Invalid=1948, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 18:19:33,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39774 states. [2019-09-07 18:19:33,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39774 to 39036. [2019-09-07 18:19:33,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39036 states. [2019-09-07 18:19:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39036 states to 39036 states and 46435 transitions. [2019-09-07 18:19:34,047 INFO L78 Accepts]: Start accepts. Automaton has 39036 states and 46435 transitions. Word has length 535 [2019-09-07 18:19:34,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:34,048 INFO L475 AbstractCegarLoop]: Abstraction has 39036 states and 46435 transitions. [2019-09-07 18:19:34,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 18:19:34,048 INFO L276 IsEmpty]: Start isEmpty. Operand 39036 states and 46435 transitions. [2019-09-07 18:19:34,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2019-09-07 18:19:34,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:34,095 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:19:34,095 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:34,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:34,096 INFO L82 PathProgramCache]: Analyzing trace with hash -636055596, now seen corresponding path program 1 times [2019-09-07 18:19:34,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:34,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:34,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:34,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:34,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 334 proven. 174 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-09-07 18:19:34,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:34,698 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) [2019-09-07 18:19:34,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:19:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:34,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:19:34,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:34,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:34,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:34,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 854 backedges. 542 proven. 2 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-09-07 18:19:37,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:19:37,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 9 [2019-09-07 18:19:37,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:19:37,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:19:37,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=50, Unknown=1, NotChecked=0, Total=72 [2019-09-07 18:19:37,166 INFO L87 Difference]: Start difference. First operand 39036 states and 46435 transitions. Second operand 9 states. [2019-09-07 18:19:38,210 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 19 [2019-09-07 18:19:41,185 WARN L188 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 36 DAG size of output: 17 [2019-09-07 18:19:43,307 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 18 [2019-09-07 18:20:03,183 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-09-07 18:20:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:20:05,529 INFO L93 Difference]: Finished difference Result 85670 states and 103609 transitions. [2019-09-07 18:20:05,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 18:20:05,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 546 [2019-09-07 18:20:05,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:20:05,628 INFO L225 Difference]: With dead ends: 85670 [2019-09-07 18:20:05,628 INFO L226 Difference]: Without dead ends: 47018 [2019-09-07 18:20:05,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 555 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=128, Invalid=333, Unknown=1, NotChecked=0, Total=462 [2019-09-07 18:20:05,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47018 states. [2019-09-07 18:20:06,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47018 to 46091. [2019-09-07 18:20:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46091 states. [2019-09-07 18:20:06,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46091 states to 46091 states and 53625 transitions. [2019-09-07 18:20:06,247 INFO L78 Accepts]: Start accepts. Automaton has 46091 states and 53625 transitions. Word has length 546 [2019-09-07 18:20:06,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:20:06,248 INFO L475 AbstractCegarLoop]: Abstraction has 46091 states and 53625 transitions. [2019-09-07 18:20:06,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:20:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 46091 states and 53625 transitions. [2019-09-07 18:20:06,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2019-09-07 18:20:06,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:20:06,298 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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 18:20:06,298 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:20:06,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:20:06,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1779383596, now seen corresponding path program 1 times [2019-09-07 18:20:06,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:20:06,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:20:06,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:06,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:06,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 612 proven. 300 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 18:20:09,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:20:09,836 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 18:20:09,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:09,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:20:10,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:20:10,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:20:10,394 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 725 proven. 2 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:20:10,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:20:10,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 5] total 32 [2019-09-07 18:20:10,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 18:20:10,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 18:20:10,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2019-09-07 18:20:10,405 INFO L87 Difference]: Start difference. First operand 46091 states and 53625 transitions. Second operand 32 states. [2019-09-07 18:20:11,803 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-07 18:20:12,090 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-07 18:20:12,334 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-09-07 18:20:12,500 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-07 18:20:13,396 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-09-07 18:20:14,437 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-07 18:20:14,647 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-07 18:20:15,242 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-07 18:20:15,915 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2019-09-07 18:20:17,524 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-07 18:20:17,850 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-07 18:20:18,410 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2019-09-07 18:20:18,622 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-07 18:20:18,847 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-07 18:20:19,287 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-07 18:20:19,558 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-07 18:20:19,814 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-07 18:20:20,286 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-07 18:20:20,850 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-07 18:20:21,072 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-07 18:20:22,510 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-07 18:20:22,860 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-09-07 18:20:23,319 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-07 18:20:23,628 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-07 18:20:24,686 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-07 18:20:25,180 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-07 18:20:25,667 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2019-09-07 18:20:25,890 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2019-09-07 18:20:26,927 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 48 [2019-09-07 18:20:27,114 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 39 [2019-09-07 18:20:27,545 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-07 18:20:28,328 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-07 18:20:28,972 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-07 18:20:30,939 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2019-09-07 18:20:31,355 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-09-07 18:20:32,309 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-07 18:20:32,731 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 41 [2019-09-07 18:20:32,968 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-07 18:20:33,289 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 44 [2019-09-07 18:20:33,526 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-07 18:20:34,016 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-07 18:20:34,334 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2019-09-07 18:20:34,594 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-09-07 18:20:34,961 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-07 18:20:36,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:20:36,166 INFO L93 Difference]: Finished difference Result 101405 states and 119307 transitions. [2019-09-07 18:20:36,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-07 18:20:36,166 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 557 [2019-09-07 18:20:36,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:20:36,267 INFO L225 Difference]: With dead ends: 101405 [2019-09-07 18:20:36,267 INFO L226 Difference]: Without dead ends: 55698 [2019-09-07 18:20:36,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 621 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5783 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=2737, Invalid=14555, Unknown=0, NotChecked=0, Total=17292 [2019-09-07 18:20:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55698 states. [2019-09-07 18:20:36,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55698 to 50405. [2019-09-07 18:20:36,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50405 states. [2019-09-07 18:20:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50405 states to 50405 states and 58064 transitions. [2019-09-07 18:20:36,936 INFO L78 Accepts]: Start accepts. Automaton has 50405 states and 58064 transitions. Word has length 557 [2019-09-07 18:20:36,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:20:36,936 INFO L475 AbstractCegarLoop]: Abstraction has 50405 states and 58064 transitions. [2019-09-07 18:20:36,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 18:20:36,937 INFO L276 IsEmpty]: Start isEmpty. Operand 50405 states and 58064 transitions. [2019-09-07 18:20:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2019-09-07 18:20:36,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:20:36,987 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-07 18:20:36,987 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:20:36,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:20:36,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2102901783, now seen corresponding path program 1 times [2019-09-07 18:20:36,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:20:36,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:20:36,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:36,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:36,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1196 backedges. 688 proven. 2 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-07 18:20:37,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:20:37,442 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 18:20:37,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:37,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:20:37,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:20:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1196 backedges. 688 proven. 2 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-07 18:20:38,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:20:38,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-09-07 18:20:38,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 18:20:38,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 18:20:38,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-07 18:20:38,137 INFO L87 Difference]: Start difference. First operand 50405 states and 58064 transitions. Second operand 8 states. [2019-09-07 18:20:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:20:40,678 INFO L93 Difference]: Finished difference Result 97863 states and 113354 transitions. [2019-09-07 18:20:40,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 18:20:40,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 581 [2019-09-07 18:20:40,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:20:40,773 INFO L225 Difference]: With dead ends: 97863 [2019-09-07 18:20:40,773 INFO L226 Difference]: Without dead ends: 51610 [2019-09-07 18:20:40,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-07 18:20:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51610 states. [2019-09-07 18:20:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51610 to 50040. [2019-09-07 18:20:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50040 states. [2019-09-07 18:20:41,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50040 states to 50040 states and 57454 transitions. [2019-09-07 18:20:41,404 INFO L78 Accepts]: Start accepts. Automaton has 50040 states and 57454 transitions. Word has length 581 [2019-09-07 18:20:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:20:41,405 INFO L475 AbstractCegarLoop]: Abstraction has 50040 states and 57454 transitions. [2019-09-07 18:20:41,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 18:20:41,405 INFO L276 IsEmpty]: Start isEmpty. Operand 50040 states and 57454 transitions. [2019-09-07 18:20:41,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2019-09-07 18:20:41,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:20:41,442 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:20:41,443 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:20:41,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:20:41,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1039831568, now seen corresponding path program 1 times [2019-09-07 18:20:41,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:20:41,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:20:41,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:41,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:41,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:42,396 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 716 proven. 110 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-07 18:20:42,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:20:42,396 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 18:20:42,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:42,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 18:20:42,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:20:42,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:20:42,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:20:42,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-07 18:20:42,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 18:20:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 580 proven. 2 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2019-09-07 18:20:44,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:20:44,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 17 [2019-09-07 18:20:44,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 18:20:44,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 18:20:44,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-09-07 18:20:44,805 INFO L87 Difference]: Start difference. First operand 50040 states and 57454 transitions. Second operand 17 states. [2019-09-07 18:20:44,940 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-07 18:20:46,363 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-07 18:20:48,254 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-07 18:20:48,736 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-07 18:20:49,150 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-07 18:20:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:20:52,417 INFO L93 Difference]: Finished difference Result 97409 states and 111992 transitions. [2019-09-07 18:20:52,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 18:20:52,418 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 593 [2019-09-07 18:20:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:20:52,502 INFO L225 Difference]: With dead ends: 97409 [2019-09-07 18:20:52,502 INFO L226 Difference]: Without dead ends: 50861 [2019-09-07 18:20:52,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 614 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=531, Invalid=1725, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 18:20:52,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50861 states. [2019-09-07 18:20:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50861 to 49572. [2019-09-07 18:20:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49572 states. [2019-09-07 18:20:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49572 states to 49572 states and 56727 transitions. [2019-09-07 18:20:53,236 INFO L78 Accepts]: Start accepts. Automaton has 49572 states and 56727 transitions. Word has length 593 [2019-09-07 18:20:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:20:53,236 INFO L475 AbstractCegarLoop]: Abstraction has 49572 states and 56727 transitions. [2019-09-07 18:20:53,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 18:20:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 49572 states and 56727 transitions. [2019-09-07 18:20:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2019-09-07 18:20:53,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:20:53,277 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2019-09-07 18:20:53,277 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:20:53,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:20:53,277 INFO L82 PathProgramCache]: Analyzing trace with hash 516169460, now seen corresponding path program 1 times [2019-09-07 18:20:53,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:20:53,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:20:53,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:53,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:53,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 698 proven. 2 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2019-09-07 18:20:54,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:20:54,328 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 18:20:54,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:54,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 18:20:54,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:20:54,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-07 18:20:54,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 18:20:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 698 proven. 2 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2019-09-07 18:20:55,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:20:55,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2019-09-07 18:20:55,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 18:20:55,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 18:20:55,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:20:55,669 INFO L87 Difference]: Start difference. First operand 49572 states and 56727 transitions. Second operand 15 states. [2019-09-07 18:20:57,332 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-07 18:20:57,991 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-07 18:20:58,157 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-07 18:20:59,401 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-07 18:21:00,281 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-07 18:21:01,996 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-07 18:21:02,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:21:02,474 INFO L93 Difference]: Finished difference Result 95342 states and 109266 transitions. [2019-09-07 18:21:02,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 18:21:02,475 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 615 [2019-09-07 18:21:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:21:02,585 INFO L225 Difference]: With dead ends: 95342 [2019-09-07 18:21:02,585 INFO L226 Difference]: Without dead ends: 48964 [2019-09-07 18:21:02,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 18:21:02,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48964 states. [2019-09-07 18:21:03,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48964 to 48804. [2019-09-07 18:21:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48804 states. [2019-09-07 18:21:03,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48804 states to 48804 states and 55815 transitions. [2019-09-07 18:21:03,225 INFO L78 Accepts]: Start accepts. Automaton has 48804 states and 55815 transitions. Word has length 615 [2019-09-07 18:21:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:21:03,226 INFO L475 AbstractCegarLoop]: Abstraction has 48804 states and 55815 transitions. [2019-09-07 18:21:03,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 18:21:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 48804 states and 55815 transitions. [2019-09-07 18:21:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2019-09-07 18:21:03,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:21:03,267 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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 18:21:03,267 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:21:03,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:21:03,267 INFO L82 PathProgramCache]: Analyzing trace with hash 725908523, now seen corresponding path program 1 times [2019-09-07 18:21:03,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:21:03,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:21:03,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:03,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:03,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 698 proven. 2 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2019-09-07 18:21:04,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:21:04,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:21:04,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:04,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 18:21:04,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:21:05,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-07 18:21:05,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 18:21:06,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 698 proven. 2 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2019-09-07 18:21:06,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:21:06,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2019-09-07 18:21:06,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 18:21:06,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 18:21:06,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-09-07 18:21:06,085 INFO L87 Difference]: Start difference. First operand 48804 states and 55815 transitions. Second operand 17 states. [2019-09-07 18:21:08,173 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-07 18:21:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:21:14,682 INFO L93 Difference]: Finished difference Result 99667 states and 114210 transitions. [2019-09-07 18:21:14,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 18:21:14,682 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 616 [2019-09-07 18:21:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:21:14,770 INFO L225 Difference]: With dead ends: 99667 [2019-09-07 18:21:14,770 INFO L226 Difference]: Without dead ends: 51247 [2019-09-07 18:21:14,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=423, Invalid=1383, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 18:21:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51247 states. [2019-09-07 18:21:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51247 to 50484. [2019-09-07 18:21:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50484 states. [2019-09-07 18:21:15,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50484 states to 50484 states and 57500 transitions. [2019-09-07 18:21:15,358 INFO L78 Accepts]: Start accepts. Automaton has 50484 states and 57500 transitions. Word has length 616 [2019-09-07 18:21:15,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:21:15,358 INFO L475 AbstractCegarLoop]: Abstraction has 50484 states and 57500 transitions. [2019-09-07 18:21:15,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 18:21:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand 50484 states and 57500 transitions. [2019-09-07 18:21:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2019-09-07 18:21:15,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:21:15,399 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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 18:21:15,399 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:21:15,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:21:15,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1198248169, now seen corresponding path program 1 times [2019-09-07 18:21:15,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:21:15,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:21:15,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:15,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 321 proven. 2 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2019-09-07 18:21:15,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:21:15,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:21:15,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:15,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 18:21:15,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:21:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2019-09-07 18:21:16,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:21:16,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 18:21:16,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 18:21:16,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 18:21:16,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:21:16,108 INFO L87 Difference]: Start difference. First operand 50484 states and 57500 transitions. Second operand 3 states. [2019-09-07 18:21:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:21:17,222 INFO L93 Difference]: Finished difference Result 96171 states and 109547 transitions. [2019-09-07 18:21:17,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 18:21:17,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 616 [2019-09-07 18:21:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:21:17,296 INFO L225 Difference]: With dead ends: 96171 [2019-09-07 18:21:17,296 INFO L226 Difference]: Without dead ends: 48969 [2019-09-07 18:21:17,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 617 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 18:21:17,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48969 states. [2019-09-07 18:21:18,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48969 to 48585. [2019-09-07 18:21:18,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48585 states. [2019-09-07 18:21:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48585 states to 48585 states and 54868 transitions. [2019-09-07 18:21:18,232 INFO L78 Accepts]: Start accepts. Automaton has 48585 states and 54868 transitions. Word has length 616 [2019-09-07 18:21:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:21:18,232 INFO L475 AbstractCegarLoop]: Abstraction has 48585 states and 54868 transitions. [2019-09-07 18:21:18,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 18:21:18,232 INFO L276 IsEmpty]: Start isEmpty. Operand 48585 states and 54868 transitions. [2019-09-07 18:21:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2019-09-07 18:21:18,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:21:18,293 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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 18:21:18,293 INFO L418 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:21:18,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:21:18,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1713998386, now seen corresponding path program 1 times [2019-09-07 18:21:18,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:21:18,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:21:18,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:18,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:18,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 463 proven. 107 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2019-09-07 18:21:18,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:21:18,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:21:18,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:18,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:21:18,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:21:18,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:18,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:18,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:18,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:18,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:18,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:18,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 725 proven. 2 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-09-07 18:21:19,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:21:19,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 18:21:19,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:21:19,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:21:19,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:21:19,178 INFO L87 Difference]: Start difference. First operand 48585 states and 54868 transitions. Second operand 6 states. [2019-09-07 18:21:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:21:20,870 INFO L93 Difference]: Finished difference Result 98959 states and 111944 transitions. [2019-09-07 18:21:20,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 18:21:20,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 649 [2019-09-07 18:21:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:21:20,953 INFO L225 Difference]: With dead ends: 98959 [2019-09-07 18:21:20,953 INFO L226 Difference]: Without dead ends: 50758 [2019-09-07 18:21:20,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 653 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 18:21:21,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50758 states. [2019-09-07 18:21:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50758 to 50293. [2019-09-07 18:21:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50293 states. [2019-09-07 18:21:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50293 states to 50293 states and 56780 transitions. [2019-09-07 18:21:21,566 INFO L78 Accepts]: Start accepts. Automaton has 50293 states and 56780 transitions. Word has length 649 [2019-09-07 18:21:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:21:21,566 INFO L475 AbstractCegarLoop]: Abstraction has 50293 states and 56780 transitions. [2019-09-07 18:21:21,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:21:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 50293 states and 56780 transitions. [2019-09-07 18:21:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 826 [2019-09-07 18:21:21,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:21:21,618 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-09-07 18:21:21,618 INFO L418 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:21:21,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:21:21,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1922070484, now seen corresponding path program 1 times [2019-09-07 18:21:21,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:21:21,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:21:21,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:21,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:21,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2408 backedges. 517 proven. 387 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-09-07 18:21:23,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:21:23,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:21:23,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:23,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 1248 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 18:21:23,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:21:23,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:23,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2408 backedges. 1676 proven. 2 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2019-09-07 18:21:24,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:21:24,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 18:21:24,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:21:24,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:21:24,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:21:24,275 INFO L87 Difference]: Start difference. First operand 50293 states and 56780 transitions. Second operand 9 states. [2019-09-07 18:21:28,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:21:28,493 INFO L93 Difference]: Finished difference Result 108001 states and 122557 transitions. [2019-09-07 18:21:28,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 18:21:28,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 825 [2019-09-07 18:21:28,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:21:28,609 INFO L225 Difference]: With dead ends: 108001 [2019-09-07 18:21:28,609 INFO L226 Difference]: Without dead ends: 58092 [2019-09-07 18:21:28,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 848 GetRequests, 832 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-09-07 18:21:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58092 states. [2019-09-07 18:21:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58092 to 57199. [2019-09-07 18:21:29,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57199 states. [2019-09-07 18:21:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57199 states to 57199 states and 63552 transitions. [2019-09-07 18:21:29,348 INFO L78 Accepts]: Start accepts. Automaton has 57199 states and 63552 transitions. Word has length 825 [2019-09-07 18:21:29,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:21:29,349 INFO L475 AbstractCegarLoop]: Abstraction has 57199 states and 63552 transitions. [2019-09-07 18:21:29,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:21:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 57199 states and 63552 transitions. [2019-09-07 18:21:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 895 [2019-09-07 18:21:29,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:21:29,410 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-07 18:21:29,410 INFO L418 AbstractCegarLoop]: === Iteration 24 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:21:29,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:21:29,411 INFO L82 PathProgramCache]: Analyzing trace with hash -811130273, now seen corresponding path program 1 times [2019-09-07 18:21:29,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:21:29,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:21:29,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:29,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:29,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2567 backedges. 882 proven. 643 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2019-09-07 18:21:30,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:21:30,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:21:30,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:30,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1310 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 18:21:30,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:21:30,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:30,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:33,650 WARN L188 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-09-07 18:21:33,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:33,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:41,741 WARN L188 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-07 18:21:43,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:21:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2567 backedges. 1459 proven. 425 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2019-09-07 18:21:44,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:21:44,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 14 [2019-09-07 18:21:44,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 18:21:44,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 18:21:44,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=140, Unknown=3, NotChecked=0, Total=182 [2019-09-07 18:21:44,386 INFO L87 Difference]: Start difference. First operand 57199 states and 63552 transitions. Second operand 14 states. [2019-09-07 18:21:45,314 WARN L188 SmtUtils]: Spent 909.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-09-07 18:26:16,747 WARN L188 SmtUtils]: Spent 14.09 s on a formula simplification that was a NOOP. DAG size: 33 [2019-09-07 18:31:11,696 WARN L188 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 18