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/Problem15_label01.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:14:05,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:14:05,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:14:05,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:14:05,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:14:05,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:14:05,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:14:05,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:14:05,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:14:05,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:14:05,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:14:05,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:14:05,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:14:05,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:14:05,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:14:05,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:14:05,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:14:05,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:14:05,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:14:05,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:14:05,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:14:05,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:14:05,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:14:05,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:14:05,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:14:05,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:14:05,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:14:05,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:14:05,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:14:05,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:14:05,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:14:05,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:14:05,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:14:05,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:14:05,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:14:05,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:14:05,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:14:05,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:14:05,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:14:05,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:14:05,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:14:05,438 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 20:14:05,474 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:14:05,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:14:05,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:14:05,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:14:05,476 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:14:05,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:14:05,480 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:14:05,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:14:05,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:14:05,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:14:05,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:14:05,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:14:05,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:14:05,481 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:14:05,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:14:05,485 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:14:05,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:14:05,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:14:05,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:14:05,486 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:14:05,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:14:05,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:14:05,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:14:05,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:14:05,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:14:05,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:14:05,487 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:14:05,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:14:05,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:14:05,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:14:05,558 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:14:05,562 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:14:05,564 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:14:05,564 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:14:05,565 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label01.c [2019-09-07 20:14:05,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990a4b649/fd55fb53775346eca51bd008747de641/FLAG826680bcb [2019-09-07 20:14:06,264 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:14:06,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label01.c [2019-09-07 20:14:06,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990a4b649/fd55fb53775346eca51bd008747de641/FLAG826680bcb [2019-09-07 20:14:06,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990a4b649/fd55fb53775346eca51bd008747de641 [2019-09-07 20:14:06,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:14:06,471 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:14:06,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:14:06,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:14:06,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:14:06,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:14:06" (1/1) ... [2019-09-07 20:14:06,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e607a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:06, skipping insertion in model container [2019-09-07 20:14:06,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:14:06" (1/1) ... [2019-09-07 20:14:06,488 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:14:06,563 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:14:07,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:14:07,529 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:14:08,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:14:08,032 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:14:08,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:08 WrapperNode [2019-09-07 20:14:08,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:14:08,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:14:08,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:14:08,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:14:08,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:08" (1/1) ... [2019-09-07 20:14:08,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:08" (1/1) ... [2019-09-07 20:14:08,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:08" (1/1) ... [2019-09-07 20:14:08,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:08" (1/1) ... [2019-09-07 20:14:08,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:08" (1/1) ... [2019-09-07 20:14:08,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:08" (1/1) ... [2019-09-07 20:14:08,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:08" (1/1) ... [2019-09-07 20:14:08,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:14:08,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:14:08,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:14:08,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:14:08,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:08" (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 20:14:08,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:14:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:14:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:14:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:14:08,321 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:14:08,321 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:14:08,322 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:14:08,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:14:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:14:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:14:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:14:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:14:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:14:11,339 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:14:11,340 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:14:11,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:14:11 BoogieIcfgContainer [2019-09-07 20:14:11,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:14:11,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:14:11,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:14:11,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:14:11,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:14:06" (1/3) ... [2019-09-07 20:14:11,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4848f72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:14:11, skipping insertion in model container [2019-09-07 20:14:11,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:08" (2/3) ... [2019-09-07 20:14:11,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4848f72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:14:11, skipping insertion in model container [2019-09-07 20:14:11,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:14:11" (3/3) ... [2019-09-07 20:14:11,354 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label01.c [2019-09-07 20:14:11,366 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:14:11,381 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:14:11,399 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:14:11,455 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:14:11,456 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:14:11,456 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:14:11,456 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:14:11,456 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:14:11,456 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:14:11,456 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:14:11,457 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:14:11,457 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:14:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-09-07 20:14:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 20:14:11,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:14:11,503 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] [2019-09-07 20:14:11,505 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:14:11,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:14:11,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2133968144, now seen corresponding path program 1 times [2019-09-07 20:14:11,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:14:11,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:14:11,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:11,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:11,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:11,903 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 20:14:11,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:14:11,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:14:11,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:14:11,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:14:11,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:14:11,929 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 4 states. [2019-09-07 20:14:16,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:14:16,052 INFO L93 Difference]: Finished difference Result 1546 states and 2831 transitions. [2019-09-07 20:14:16,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:14:16,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-07 20:14:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:14:16,078 INFO L225 Difference]: With dead ends: 1546 [2019-09-07 20:14:16,079 INFO L226 Difference]: Without dead ends: 1028 [2019-09-07 20:14:16,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:14:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-09-07 20:14:16,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 700. [2019-09-07 20:14:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-09-07 20:14:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1110 transitions. [2019-09-07 20:14:16,192 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1110 transitions. Word has length 50 [2019-09-07 20:14:16,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:14:16,193 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 1110 transitions. [2019-09-07 20:14:16,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:14:16,193 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1110 transitions. [2019-09-07 20:14:16,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-07 20:14:16,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:14:16,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:14:16,200 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:14:16,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:14:16,201 INFO L82 PathProgramCache]: Analyzing trace with hash -949745301, now seen corresponding path program 1 times [2019-09-07 20:14:16,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:14:16,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:14:16,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:16,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:16,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:14:16,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:14:16,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:14:16,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:14:16,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:14:16,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:14:16,462 INFO L87 Difference]: Start difference. First operand 700 states and 1110 transitions. Second operand 5 states. [2019-09-07 20:14:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:14:20,665 INFO L93 Difference]: Finished difference Result 2057 states and 3297 transitions. [2019-09-07 20:14:20,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:14:20,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-07 20:14:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:14:20,676 INFO L225 Difference]: With dead ends: 2057 [2019-09-07 20:14:20,676 INFO L226 Difference]: Without dead ends: 1363 [2019-09-07 20:14:20,679 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 20:14:20,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-09-07 20:14:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1333. [2019-09-07 20:14:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-09-07 20:14:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1846 transitions. [2019-09-07 20:14:20,752 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1846 transitions. Word has length 122 [2019-09-07 20:14:20,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:14:20,756 INFO L475 AbstractCegarLoop]: Abstraction has 1333 states and 1846 transitions. [2019-09-07 20:14:20,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:14:20,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1846 transitions. [2019-09-07 20:14:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 20:14:20,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:14:20,775 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:14:20,775 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:14:20,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:14:20,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1647981659, now seen corresponding path program 1 times [2019-09-07 20:14:20,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:14:20,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:14:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:20,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:20,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:14:21,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:14:21,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:14:21,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:14:21,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:14:21,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:14:21,015 INFO L87 Difference]: Start difference. First operand 1333 states and 1846 transitions. Second operand 4 states. [2019-09-07 20:14:24,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:14:24,783 INFO L93 Difference]: Finished difference Result 5136 states and 7266 transitions. [2019-09-07 20:14:24,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:14:24,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-07 20:14:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:14:24,802 INFO L225 Difference]: With dead ends: 5136 [2019-09-07 20:14:24,802 INFO L226 Difference]: Without dead ends: 3809 [2019-09-07 20:14:24,807 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 20:14:24,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809 states. [2019-09-07 20:14:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809 to 3807. [2019-09-07 20:14:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3807 states. [2019-09-07 20:14:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3807 states to 3807 states and 4928 transitions. [2019-09-07 20:14:24,909 INFO L78 Accepts]: Start accepts. Automaton has 3807 states and 4928 transitions. Word has length 130 [2019-09-07 20:14:24,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:14:24,910 INFO L475 AbstractCegarLoop]: Abstraction has 3807 states and 4928 transitions. [2019-09-07 20:14:24,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:14:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3807 states and 4928 transitions. [2019-09-07 20:14:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-07 20:14:24,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:14:24,916 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, 2, 2, 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 20:14:24,916 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:14:24,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:14:24,916 INFO L82 PathProgramCache]: Analyzing trace with hash -507271821, now seen corresponding path program 1 times [2019-09-07 20:14:24,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:14:24,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:14:24,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:24,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:24,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 86 proven. 65 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:14:25,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:14:25,104 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 20:14:25,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:25,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:14:25,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:14:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-07 20:14:25,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:14:25,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:14:25,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:14:25,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:14:25,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:14:25,401 INFO L87 Difference]: Start difference. First operand 3807 states and 4928 transitions. Second operand 9 states. [2019-09-07 20:14:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:14:29,754 INFO L93 Difference]: Finished difference Result 7757 states and 10088 transitions. [2019-09-07 20:14:29,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 20:14:29,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 205 [2019-09-07 20:14:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:14:29,772 INFO L225 Difference]: With dead ends: 7757 [2019-09-07 20:14:29,772 INFO L226 Difference]: Without dead ends: 3956 [2019-09-07 20:14:29,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2019-09-07 20:14:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2019-09-07 20:14:29,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 3912. [2019-09-07 20:14:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3912 states. [2019-09-07 20:14:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 4592 transitions. [2019-09-07 20:14:29,880 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 4592 transitions. Word has length 205 [2019-09-07 20:14:29,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:14:29,880 INFO L475 AbstractCegarLoop]: Abstraction has 3912 states and 4592 transitions. [2019-09-07 20:14:29,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:14:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 4592 transitions. [2019-09-07 20:14:29,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-07 20:14:29,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:14:29,886 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:14:29,887 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:14:29,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:14:29,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1892875544, now seen corresponding path program 1 times [2019-09-07 20:14:29,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:14:29,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:14:29,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:29,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:29,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 113 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:14:30,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:14:30,316 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 20:14:30,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:30,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:14:30,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:14:30,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:14:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-07 20:14:30,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:14:30,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-07 20:14:30,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:14:30,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:14:30,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:14:30,707 INFO L87 Difference]: Start difference. First operand 3912 states and 4592 transitions. Second operand 10 states. [2019-09-07 20:14:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:14:42,400 INFO L93 Difference]: Finished difference Result 13122 states and 15668 transitions. [2019-09-07 20:14:42,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 20:14:42,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 319 [2019-09-07 20:14:42,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:14:42,439 INFO L225 Difference]: With dead ends: 13122 [2019-09-07 20:14:42,439 INFO L226 Difference]: Without dead ends: 9216 [2019-09-07 20:14:42,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2019-09-07 20:14:42,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2019-09-07 20:14:42,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 8181. [2019-09-07 20:14:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8181 states. [2019-09-07 20:14:42,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8181 states to 8181 states and 9603 transitions. [2019-09-07 20:14:42,687 INFO L78 Accepts]: Start accepts. Automaton has 8181 states and 9603 transitions. Word has length 319 [2019-09-07 20:14:42,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:14:42,688 INFO L475 AbstractCegarLoop]: Abstraction has 8181 states and 9603 transitions. [2019-09-07 20:14:42,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:14:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 8181 states and 9603 transitions. [2019-09-07 20:14:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-09-07 20:14:42,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:14:42,699 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:14:42,699 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:14:42,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:14:42,700 INFO L82 PathProgramCache]: Analyzing trace with hash 468674489, now seen corresponding path program 1 times [2019-09-07 20:14:42,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:14:42,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:14:42,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:42,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:42,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:43,185 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 83 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-07 20:14:43,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:14:43,186 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:14:43,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:14:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:43,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 20:14:43,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:14:43,514 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-07 20:14:43,703 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2019-09-07 20:14:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-07 20:14:43,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:14:43,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2019-09-07 20:14:43,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:14:43,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:14:43,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:14:43,949 INFO L87 Difference]: Start difference. First operand 8181 states and 9603 transitions. Second operand 13 states. [2019-09-07 20:15:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:15:12,209 INFO L93 Difference]: Finished difference Result 24249 states and 29737 transitions. [2019-09-07 20:15:12,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 20:15:12,210 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 405 [2019-09-07 20:15:12,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:15:12,277 INFO L225 Difference]: With dead ends: 24249 [2019-09-07 20:15:12,277 INFO L226 Difference]: Without dead ends: 16381 [2019-09-07 20:15:12,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 404 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2019-09-07 20:15:12,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16381 states. [2019-09-07 20:15:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16381 to 14289. [2019-09-07 20:15:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14289 states. [2019-09-07 20:15:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14289 states to 14289 states and 17065 transitions. [2019-09-07 20:15:12,728 INFO L78 Accepts]: Start accepts. Automaton has 14289 states and 17065 transitions. Word has length 405 [2019-09-07 20:15:12,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:15:12,731 INFO L475 AbstractCegarLoop]: Abstraction has 14289 states and 17065 transitions. [2019-09-07 20:15:12,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:15:12,732 INFO L276 IsEmpty]: Start isEmpty. Operand 14289 states and 17065 transitions. [2019-09-07 20:15:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2019-09-07 20:15:12,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:15:12,752 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:15:12,752 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:15:12,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:15:12,753 INFO L82 PathProgramCache]: Analyzing trace with hash -735762229, now seen corresponding path program 1 times [2019-09-07 20:15:12,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:15:12,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:15:12,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:12,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:15:12,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 226 proven. 69 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-07 20:15:13,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:15:13,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:15:13,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:15:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:13,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 20:15:13,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:15:13,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:15:13,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:15:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 277 proven. 41 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-07 20:15:14,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:15:14,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2019-09-07 20:15:14,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:15:14,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:15:14,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:15:14,574 INFO L87 Difference]: Start difference. First operand 14289 states and 17065 transitions. Second operand 13 states. [2019-09-07 20:15:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:15:29,672 INFO L93 Difference]: Finished difference Result 49440 states and 61531 transitions. [2019-09-07 20:15:29,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 20:15:29,673 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 465 [2019-09-07 20:15:29,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:15:29,788 INFO L225 Difference]: With dead ends: 49440 [2019-09-07 20:15:29,788 INFO L226 Difference]: Without dead ends: 28119 [2019-09-07 20:15:29,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1957 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1042, Invalid=4508, Unknown=0, NotChecked=0, Total=5550 [2019-09-07 20:15:29,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28119 states. [2019-09-07 20:15:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28119 to 22757. [2019-09-07 20:15:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22757 states. [2019-09-07 20:15:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22757 states to 22757 states and 26804 transitions. [2019-09-07 20:15:30,530 INFO L78 Accepts]: Start accepts. Automaton has 22757 states and 26804 transitions. Word has length 465 [2019-09-07 20:15:30,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:15:30,531 INFO L475 AbstractCegarLoop]: Abstraction has 22757 states and 26804 transitions. [2019-09-07 20:15:30,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:15:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 22757 states and 26804 transitions. [2019-09-07 20:15:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2019-09-07 20:15:30,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:15:30,545 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:15:30,546 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:15:30,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:15:30,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1114093981, now seen corresponding path program 1 times [2019-09-07 20:15:30,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:15:30,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:15:30,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:30,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:15:30,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2019-09-07 20:15:31,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:15:31,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:15:31,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:15:31,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:15:31,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:15:31,121 INFO L87 Difference]: Start difference. First operand 22757 states and 26804 transitions. Second operand 4 states. [2019-09-07 20:15:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:15:34,229 INFO L93 Difference]: Finished difference Result 59452 states and 71333 transitions. [2019-09-07 20:15:34,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:15:34,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 482 [2019-09-07 20:15:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:15:34,327 INFO L225 Difference]: With dead ends: 59452 [2019-09-07 20:15:34,327 INFO L226 Difference]: Without dead ends: 37008 [2019-09-07 20:15:34,387 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 20:15:34,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37008 states. [2019-09-07 20:15:36,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37008 to 33605. [2019-09-07 20:15:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33605 states. [2019-09-07 20:15:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33605 states to 33605 states and 39708 transitions. [2019-09-07 20:15:36,522 INFO L78 Accepts]: Start accepts. Automaton has 33605 states and 39708 transitions. Word has length 482 [2019-09-07 20:15:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:15:36,523 INFO L475 AbstractCegarLoop]: Abstraction has 33605 states and 39708 transitions. [2019-09-07 20:15:36,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:15:36,523 INFO L276 IsEmpty]: Start isEmpty. Operand 33605 states and 39708 transitions. [2019-09-07 20:15:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2019-09-07 20:15:36,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:15:36,539 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:15:36,539 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:15:36,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:15:36,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1632854708, now seen corresponding path program 1 times [2019-09-07 20:15:36,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:15:36,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:15:36,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:36,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:15:36,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 268 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 20:15:36,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:15:36,954 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 20:15:36,967 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 20:15:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:37,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 20:15:37,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:15:37,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:15:37,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:15:37,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:15:37,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:21,684 WARN L188 SmtUtils]: Spent 43.67 s on a formula simplification. DAG size of input: 428 DAG size of output: 50 [2019-09-07 20:16:21,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 224 proven. 46 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 20:16:22,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:16:22,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-09-07 20:16:22,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:16:22,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:16:22,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:16:22,261 INFO L87 Difference]: Start difference. First operand 33605 states and 39708 transitions. Second operand 9 states. [2019-09-07 20:16:24,628 WARN L188 SmtUtils]: Spent 803.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-09-07 20:16:34,629 WARN L188 SmtUtils]: Spent 810.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-09-07 20:16:36,438 WARN L188 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-07 20:17:22,761 WARN L188 SmtUtils]: Spent 846.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-09-07 20:17:34,288 WARN L188 SmtUtils]: Spent 837.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-09-07 20:17:36,124 WARN L188 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-07 20:17:45,996 WARN L188 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-07 20:17:46,917 WARN L188 SmtUtils]: Spent 884.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-07 20:17:56,706 WARN L188 SmtUtils]: Spent 858.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-09-07 20:18:04,824 WARN L188 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-07 20:18:13,841 WARN L188 SmtUtils]: Spent 846.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-07 20:19:48,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:19:48,462 INFO L93 Difference]: Finished difference Result 103817 states and 126727 transitions. [2019-09-07 20:19:48,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 20:19:48,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 504 [2019-09-07 20:19:48,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:19:48,763 INFO L225 Difference]: With dead ends: 103817 [2019-09-07 20:19:48,763 INFO L226 Difference]: Without dead ends: 69901 [2019-09-07 20:19:48,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 544 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 58.4s TimeCoverageRelationStatistics Valid=635, Invalid=3025, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 20:19:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69901 states. [2019-09-07 20:19:49,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69901 to 64551. [2019-09-07 20:19:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64551 states. [2019-09-07 20:19:50,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64551 states to 64551 states and 75760 transitions. [2019-09-07 20:19:50,047 INFO L78 Accepts]: Start accepts. Automaton has 64551 states and 75760 transitions. Word has length 504 [2019-09-07 20:19:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:19:50,048 INFO L475 AbstractCegarLoop]: Abstraction has 64551 states and 75760 transitions. [2019-09-07 20:19:50,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:19:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 64551 states and 75760 transitions. [2019-09-07 20:19:50,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2019-09-07 20:19:50,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:19:50,067 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:19:50,068 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:19:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:19:50,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1820181485, now seen corresponding path program 1 times [2019-09-07 20:19:50,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:19:50,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:19:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:19:50,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:19:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:19:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:19:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 6 proven. 141 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-07 20:19:51,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:19:51,896 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 20:19:51,910 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 20:19:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:19:52,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 20:19:52,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:19:52,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:19:52,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:20:08,425 WARN L188 SmtUtils]: Spent 16.31 s on a formula simplification that was a NOOP. DAG size: 39 [2019-09-07 20:20:08,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:20:08,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:20:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 248 proven. 110 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-07 20:20:08,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:20:08,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-09-07 20:20:08,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 20:20:08,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 20:20:08,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:20:08,845 INFO L87 Difference]: Start difference. First operand 64551 states and 75760 transitions. Second operand 16 states. [2019-09-07 20:20:34,715 WARN L188 SmtUtils]: Spent 22.23 s on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-07 20:21:03,076 WARN L188 SmtUtils]: Spent 28.31 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-07 20:21:09,226 WARN L188 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 67 DAG size of output: 35 [2019-09-07 20:21:32,916 WARN L188 SmtUtils]: Spent 22.46 s on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-09-07 20:22:03,406 WARN L188 SmtUtils]: Spent 30.29 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-07 20:22:24,558 WARN L188 SmtUtils]: Spent 18.21 s on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-09-07 20:23:07,736 WARN L188 SmtUtils]: Spent 35.44 s on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-07 20:23:31,588 WARN L188 SmtUtils]: Spent 22.22 s on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-07 20:23:40,748 WARN L188 SmtUtils]: Spent 6.77 s on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-07 20:24:08,150 WARN L188 SmtUtils]: Spent 26.34 s on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-07 20:24:12,625 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 44 DAG size of output: 11 [2019-09-07 20:24:43,982 WARN L188 SmtUtils]: Spent 20.17 s on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-07 20:24:48,699 WARN L188 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 51 DAG size of output: 13 [2019-09-07 20:24:53,406 WARN L188 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 51 DAG size of output: 13 [2019-09-07 20:25:23,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:25:23,893 INFO L93 Difference]: Finished difference Result 161827 states and 193592 transitions. [2019-09-07 20:25:23,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-07 20:25:23,894 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 516 [2019-09-07 20:25:23,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:25:24,505 INFO L225 Difference]: With dead ends: 161827 [2019-09-07 20:25:24,505 INFO L226 Difference]: Without dead ends: 97570 [2019-09-07 20:25:24,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 516 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5486 ImplicationChecksByTransitivity, 285.0s TimeCoverageRelationStatistics Valid=1744, Invalid=12293, Unknown=5, NotChecked=0, Total=14042 [2019-09-07 20:25:24,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97570 states. [2019-09-07 20:25:26,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97570 to 85871. [2019-09-07 20:25:26,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85871 states. [2019-09-07 20:25:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85871 states to 85871 states and 100016 transitions. [2019-09-07 20:25:26,258 INFO L78 Accepts]: Start accepts. Automaton has 85871 states and 100016 transitions. Word has length 516 [2019-09-07 20:25:26,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:25:26,261 INFO L475 AbstractCegarLoop]: Abstraction has 85871 states and 100016 transitions. [2019-09-07 20:25:26,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 20:25:26,262 INFO L276 IsEmpty]: Start isEmpty. Operand 85871 states and 100016 transitions. [2019-09-07 20:25:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-09-07 20:25:26,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:25:26,278 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:25:26,279 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:25:26,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:25:26,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1718549963, now seen corresponding path program 1 times [2019-09-07 20:25:26,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:25:26,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:25:26,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:25:26,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:25:26,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:25:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:25:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 13 proven. 134 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-07 20:25:27,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:25:27,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:25:27,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:25:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:25:27,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 20:25:27,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:25:27,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:27,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:27,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:27,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:27,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:27,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:27,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:27,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:46,225 WARN L188 SmtUtils]: Spent 18.52 s on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-07 20:25:46,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:25:59,203 WARN L188 SmtUtils]: Spent 12.79 s on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-09-07 20:25:59,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:59,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:26:01,970 WARN L188 SmtUtils]: Spent 2.70 s on a formula simplification that was a NOOP. DAG size: 25 [2019-09-07 20:26:02,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:26:02,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:26:02,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:26:02,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:26:02,528 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 31 [2019-09-07 20:26:02,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:26:02,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:26:16,744 WARN L188 SmtUtils]: Spent 4.09 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 20:26:26,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:26:26,963 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-07 20:26:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 13 proven. 134 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-07 20:26:29,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:26:29,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2019-09-07 20:26:29,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 20:26:29,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 20:26:29,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=207, Unknown=5, NotChecked=0, Total=272 [2019-09-07 20:26:29,354 INFO L87 Difference]: Start difference. First operand 85871 states and 100016 transitions. Second operand 17 states.