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/Problem16_label22.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 21:07:34,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 21:07:34,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 21:07:34,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 21:07:34,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 21:07:34,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 21:07:34,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 21:07:34,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 21:07:34,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 21:07:34,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 21:07:34,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 21:07:34,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 21:07:34,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 21:07:34,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 21:07:34,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 21:07:34,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 21:07:34,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 21:07:34,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 21:07:34,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 21:07:34,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 21:07:34,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 21:07:34,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 21:07:34,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 21:07:34,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 21:07:34,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 21:07:34,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 21:07:34,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 21:07:34,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 21:07:34,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 21:07:34,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 21:07:34,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 21:07:34,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 21:07:34,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 21:07:34,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 21:07:34,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 21:07:34,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 21:07:34,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 21:07:34,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 21:07:34,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 21:07:34,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 21:07:34,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 21:07:34,631 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 21:07:34,645 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 21:07:34,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 21:07:34,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 21:07:34,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 21:07:34,646 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 21:07:34,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 21:07:34,647 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 21:07:34,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 21:07:34,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 21:07:34,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 21:07:34,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 21:07:34,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 21:07:34,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 21:07:34,648 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 21:07:34,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 21:07:34,649 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 21:07:34,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 21:07:34,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 21:07:34,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 21:07:34,650 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 21:07:34,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 21:07:34,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:07:34,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 21:07:34,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 21:07:34,651 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 21:07:34,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 21:07:34,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 21:07:34,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 21:07:34,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 21:07:34,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 21:07:34,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 21:07:34,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 21:07:34,696 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 21:07:34,697 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 21:07:34,697 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label22.c [2019-09-07 21:07:34,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1efc05854/c8930f3d62c540c1ba55aec4f3151ed9/FLAGd50af4bb1 [2019-09-07 21:07:35,374 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 21:07:35,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label22.c [2019-09-07 21:07:35,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1efc05854/c8930f3d62c540c1ba55aec4f3151ed9/FLAGd50af4bb1 [2019-09-07 21:07:35,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1efc05854/c8930f3d62c540c1ba55aec4f3151ed9 [2019-09-07 21:07:35,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 21:07:35,538 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 21:07:35,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 21:07:35,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 21:07:35,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 21:07:35,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:07:35" (1/1) ... [2019-09-07 21:07:35,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@427c24f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:07:35, skipping insertion in model container [2019-09-07 21:07:35,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:07:35" (1/1) ... [2019-09-07 21:07:35,556 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 21:07:35,629 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 21:07:36,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:07:36,578 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 21:07:36,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:07:36,910 INFO L192 MainTranslator]: Completed translation [2019-09-07 21:07:36,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:07:36 WrapperNode [2019-09-07 21:07:36,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 21:07:36,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 21:07:36,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 21:07:36,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 21:07:36,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:07:36" (1/1) ... [2019-09-07 21:07:36,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:07:36" (1/1) ... [2019-09-07 21:07:36,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:07:36" (1/1) ... [2019-09-07 21:07:36,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:07:36" (1/1) ... [2019-09-07 21:07:37,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:07:36" (1/1) ... [2019-09-07 21:07:37,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:07:36" (1/1) ... [2019-09-07 21:07:37,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:07:36" (1/1) ... [2019-09-07 21:07:37,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 21:07:37,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 21:07:37,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 21:07:37,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 21:07:37,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:07:36" (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 21:07:37,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 21:07:37,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 21:07:37,204 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 21:07:37,205 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 21:07:37,205 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 21:07:37,205 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 21:07:37,205 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 21:07:37,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 21:07:37,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 21:07:37,206 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 21:07:37,206 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 21:07:37,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 21:07:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 21:07:39,865 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 21:07:39,865 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 21:07:39,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:07:39 BoogieIcfgContainer [2019-09-07 21:07:39,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 21:07:39,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 21:07:39,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 21:07:39,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 21:07:39,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:07:35" (1/3) ... [2019-09-07 21:07:39,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121fd16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:07:39, skipping insertion in model container [2019-09-07 21:07:39,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:07:36" (2/3) ... [2019-09-07 21:07:39,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121fd16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:07:39, skipping insertion in model container [2019-09-07 21:07:39,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:07:39" (3/3) ... [2019-09-07 21:07:39,879 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label22.c [2019-09-07 21:07:39,891 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 21:07:39,903 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 21:07:39,923 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 21:07:40,008 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 21:07:40,009 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 21:07:40,009 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 21:07:40,009 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 21:07:40,009 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 21:07:40,009 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 21:07:40,009 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 21:07:40,010 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 21:07:40,010 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 21:07:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-09-07 21:07:40,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 21:07:40,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:07:40,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:07:40,052 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:07:40,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:07:40,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1496635070, now seen corresponding path program 1 times [2019-09-07 21:07:40,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:07:40,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:07:40,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:07:40,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:07:40,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:07:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:07:40,401 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 21:07:40,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:07:40,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 21:07:40,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:07:40,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:07:40,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:07:40,430 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 3 states. [2019-09-07 21:07:42,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:07:42,791 INFO L93 Difference]: Finished difference Result 1153 states and 2141 transitions. [2019-09-07 21:07:42,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:07:42,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-07 21:07:42,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:07:42,829 INFO L225 Difference]: With dead ends: 1153 [2019-09-07 21:07:42,829 INFO L226 Difference]: Without dead ends: 682 [2019-09-07 21:07:42,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:07:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-09-07 21:07:42,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-09-07 21:07:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-07 21:07:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1166 transitions. [2019-09-07 21:07:42,951 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1166 transitions. Word has length 19 [2019-09-07 21:07:42,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:07:42,952 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1166 transitions. [2019-09-07 21:07:42,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:07:42,952 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1166 transitions. [2019-09-07 21:07:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-07 21:07:42,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:07:42,964 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 21:07:42,965 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:07:42,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:07:42,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2079855899, now seen corresponding path program 1 times [2019-09-07 21:07:42,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:07:42,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:07:42,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:07:42,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:07:42,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:07:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:07:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:07:43,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:07:43,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:07:43,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:07:43,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:07:43,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:07:43,312 INFO L87 Difference]: Start difference. First operand 682 states and 1166 transitions. Second operand 6 states. [2019-09-07 21:07:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:07:46,269 INFO L93 Difference]: Finished difference Result 1733 states and 2953 transitions. [2019-09-07 21:07:46,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:07:46,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-07 21:07:46,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:07:46,284 INFO L225 Difference]: With dead ends: 1733 [2019-09-07 21:07:46,284 INFO L226 Difference]: Without dead ends: 1057 [2019-09-07 21:07:46,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:07:46,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-09-07 21:07:46,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1039. [2019-09-07 21:07:46,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-09-07 21:07:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1701 transitions. [2019-09-07 21:07:46,351 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1701 transitions. Word has length 126 [2019-09-07 21:07:46,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:07:46,352 INFO L475 AbstractCegarLoop]: Abstraction has 1039 states and 1701 transitions. [2019-09-07 21:07:46,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:07:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1701 transitions. [2019-09-07 21:07:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-07 21:07:46,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:07:46,356 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 21:07:46,357 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:07:46,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:07:46,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1456079758, now seen corresponding path program 1 times [2019-09-07 21:07:46,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:07:46,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:07:46,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:07:46,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:07:46,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:07:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:07:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:07:46,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:07:46,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:07:46,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:07:46,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:07:46,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:07:46,561 INFO L87 Difference]: Start difference. First operand 1039 states and 1701 transitions. Second operand 6 states. [2019-09-07 21:07:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:07:49,270 INFO L93 Difference]: Finished difference Result 3130 states and 5158 transitions. [2019-09-07 21:07:49,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:07:49,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-07 21:07:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:07:49,286 INFO L225 Difference]: With dead ends: 3130 [2019-09-07 21:07:49,286 INFO L226 Difference]: Without dead ends: 2097 [2019-09-07 21:07:49,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:07:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2019-09-07 21:07:49,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 2081. [2019-09-07 21:07:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-09-07 21:07:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3125 transitions. [2019-09-07 21:07:49,368 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3125 transitions. Word has length 129 [2019-09-07 21:07:49,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:07:49,378 INFO L475 AbstractCegarLoop]: Abstraction has 2081 states and 3125 transitions. [2019-09-07 21:07:49,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:07:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3125 transitions. [2019-09-07 21:07:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-07 21:07:49,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:07:49,392 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:07:49,393 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:07:49,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:07:49,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1215276517, now seen corresponding path program 1 times [2019-09-07 21:07:49,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:07:49,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:07:49,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:07:49,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:07:49,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:07:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:07:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 24 proven. 106 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 21:07:49,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:07:49,676 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 21:07:49,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:07:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:07:49,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 21:07:49,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:07:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 21:07:49,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:07:49,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 21:07:49,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:07:49,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:07:49,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:07:49,946 INFO L87 Difference]: Start difference. First operand 2081 states and 3125 transitions. Second operand 9 states. [2019-09-07 21:07:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:07:56,251 INFO L93 Difference]: Finished difference Result 6985 states and 10568 transitions. [2019-09-07 21:07:56,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 21:07:56,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 244 [2019-09-07 21:07:56,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:07:56,283 INFO L225 Difference]: With dead ends: 6985 [2019-09-07 21:07:56,283 INFO L226 Difference]: Without dead ends: 4910 [2019-09-07 21:07:56,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=704, Unknown=0, NotChecked=0, Total=930 [2019-09-07 21:07:56,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4910 states. [2019-09-07 21:07:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4910 to 4531. [2019-09-07 21:07:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4531 states. [2019-09-07 21:07:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 5558 transitions. [2019-09-07 21:07:56,452 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 5558 transitions. Word has length 244 [2019-09-07 21:07:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:07:56,453 INFO L475 AbstractCegarLoop]: Abstraction has 4531 states and 5558 transitions. [2019-09-07 21:07:56,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:07:56,454 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 5558 transitions. [2019-09-07 21:07:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-09-07 21:07:56,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:07:56,466 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:07:56,466 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:07:56,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:07:56,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1253504530, now seen corresponding path program 1 times [2019-09-07 21:07:56,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:07:56,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:07:56,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:07:56,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:07:56,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:07:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:07:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 154 proven. 223 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-07 21:07:57,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:07:57,697 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 21:07:57,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:07:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:07:57,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:07:57,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:07:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 571 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-07 21:07:58,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:07:58,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-09-07 21:07:58,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 21:07:58,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 21:07:58,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-07 21:07:58,023 INFO L87 Difference]: Start difference. First operand 4531 states and 5558 transitions. Second operand 12 states. [2019-09-07 21:08:01,533 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-07 21:08:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:08:06,878 INFO L93 Difference]: Finished difference Result 11560 states and 14592 transitions. [2019-09-07 21:08:06,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 21:08:06,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 473 [2019-09-07 21:08:06,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:08:06,916 INFO L225 Difference]: With dead ends: 11560 [2019-09-07 21:08:06,917 INFO L226 Difference]: Without dead ends: 7035 [2019-09-07 21:08:06,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 496 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 21:08:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7035 states. [2019-09-07 21:08:07,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7035 to 6973. [2019-09-07 21:08:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6973 states. [2019-09-07 21:08:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6973 states to 6973 states and 8561 transitions. [2019-09-07 21:08:07,127 INFO L78 Accepts]: Start accepts. Automaton has 6973 states and 8561 transitions. Word has length 473 [2019-09-07 21:08:07,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:08:07,128 INFO L475 AbstractCegarLoop]: Abstraction has 6973 states and 8561 transitions. [2019-09-07 21:08:07,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 21:08:07,128 INFO L276 IsEmpty]: Start isEmpty. Operand 6973 states and 8561 transitions. [2019-09-07 21:08:07,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 807 [2019-09-07 21:08:07,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:08:07,167 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:08:07,168 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:08:07,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:08:07,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1217392193, now seen corresponding path program 1 times [2019-09-07 21:08:07,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:08:07,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:08:07,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:08:07,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:08:07,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:08:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:08:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1293 backedges. 406 proven. 115 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2019-09-07 21:08:07,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:08:07,950 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:08:07,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:08:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:08:08,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 1112 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:08:08,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:08:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1293 backedges. 949 proven. 2 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-07 21:08:08,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:08:08,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:08:08,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:08:08,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:08:08,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:08:08,474 INFO L87 Difference]: Start difference. First operand 6973 states and 8561 transitions. Second operand 9 states. [2019-09-07 21:08:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:08:13,477 INFO L93 Difference]: Finished difference Result 15320 states and 19199 transitions. [2019-09-07 21:08:13,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 21:08:13,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 806 [2019-09-07 21:08:13,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:08:13,515 INFO L225 Difference]: With dead ends: 15320 [2019-09-07 21:08:13,515 INFO L226 Difference]: Without dead ends: 8692 [2019-09-07 21:08:13,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 810 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-07 21:08:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8692 states. [2019-09-07 21:08:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8692 to 8339. [2019-09-07 21:08:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8339 states. [2019-09-07 21:08:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8339 states to 8339 states and 10103 transitions. [2019-09-07 21:08:13,700 INFO L78 Accepts]: Start accepts. Automaton has 8339 states and 10103 transitions. Word has length 806 [2019-09-07 21:08:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:08:13,701 INFO L475 AbstractCegarLoop]: Abstraction has 8339 states and 10103 transitions. [2019-09-07 21:08:13,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:08:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 8339 states and 10103 transitions. [2019-09-07 21:08:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2019-09-07 21:08:13,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:08:13,735 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:13,736 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:08:13,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:08:13,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1648807966, now seen corresponding path program 1 times [2019-09-07 21:08:13,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:08:13,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:08:13,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:08:13,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:08:13,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:08:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:08:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 73 proven. 477 refuted. 0 times theorem prover too weak. 1037 trivial. 0 not checked. [2019-09-07 21:08:15,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:08:15,014 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 21:08:15,031 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 21:08:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:08:15,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:08:15,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:08:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 1500 trivial. 0 not checked. [2019-09-07 21:08:15,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:08:15,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 21:08:15,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:08:15,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:08:15,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:08:15,862 INFO L87 Difference]: Start difference. First operand 8339 states and 10103 transitions. Second operand 9 states. [2019-09-07 21:08:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:08:23,069 INFO L93 Difference]: Finished difference Result 19421 states and 23648 transitions. [2019-09-07 21:08:23,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 21:08:23,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 813 [2019-09-07 21:08:23,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:08:23,121 INFO L225 Difference]: With dead ends: 19421 [2019-09-07 21:08:23,122 INFO L226 Difference]: Without dead ends: 11427 [2019-09-07 21:08:23,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 825 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-07 21:08:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11427 states. [2019-09-07 21:08:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11427 to 9736. [2019-09-07 21:08:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9736 states. [2019-09-07 21:08:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9736 states to 9736 states and 11095 transitions. [2019-09-07 21:08:23,336 INFO L78 Accepts]: Start accepts. Automaton has 9736 states and 11095 transitions. Word has length 813 [2019-09-07 21:08:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:08:23,337 INFO L475 AbstractCegarLoop]: Abstraction has 9736 states and 11095 transitions. [2019-09-07 21:08:23,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:08:23,338 INFO L276 IsEmpty]: Start isEmpty. Operand 9736 states and 11095 transitions. [2019-09-07 21:08:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2019-09-07 21:08:23,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:08:23,363 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-07 21:08:23,363 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:08:23,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:08:23,364 INFO L82 PathProgramCache]: Analyzing trace with hash -835380118, now seen corresponding path program 1 times [2019-09-07 21:08:23,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:08:23,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:08:23,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:08:23,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:08:23,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:08:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:08:24,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1845 backedges. 979 proven. 334 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2019-09-07 21:08:24,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:08:24,252 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:08:24,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:08:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:08:24,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:08:24,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:08:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1845 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 1758 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 21:08:25,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:08:25,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 21:08:25,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:08:25,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:08:25,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:08:25,064 INFO L87 Difference]: Start difference. First operand 9736 states and 11095 transitions. Second operand 9 states. [2019-09-07 21:08:29,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:08:29,761 INFO L93 Difference]: Finished difference Result 22834 states and 25904 transitions. [2019-09-07 21:08:29,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 21:08:29,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 869 [2019-09-07 21:08:29,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:08:29,806 INFO L225 Difference]: With dead ends: 22834 [2019-09-07 21:08:29,806 INFO L226 Difference]: Without dead ends: 13443 [2019-09-07 21:08:29,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 892 GetRequests, 879 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-07 21:08:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13443 states. [2019-09-07 21:08:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13443 to 9393. [2019-09-07 21:08:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9393 states. [2019-09-07 21:08:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9393 states to 9393 states and 10403 transitions. [2019-09-07 21:08:30,010 INFO L78 Accepts]: Start accepts. Automaton has 9393 states and 10403 transitions. Word has length 869 [2019-09-07 21:08:30,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:08:30,011 INFO L475 AbstractCegarLoop]: Abstraction has 9393 states and 10403 transitions. [2019-09-07 21:08:30,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:08:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 9393 states and 10403 transitions. [2019-09-07 21:08:30,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2019-09-07 21:08:30,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:08:30,038 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:30,038 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:08:30,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:08:30,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1361775469, now seen corresponding path program 1 times [2019-09-07 21:08:30,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:08:30,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:08:30,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:08:30,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:08:30,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:08:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:08:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1366 backedges. 640 proven. 15 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2019-09-07 21:08:31,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:08:31,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:08:31,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:08:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:08:31,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 21:08:31,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:08:31,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:08:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1366 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2019-09-07 21:08:32,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:08:32,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-09-07 21:08:32,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 21:08:32,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 21:08:32,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-07 21:08:32,031 INFO L87 Difference]: Start difference. First operand 9393 states and 10403 transitions. Second operand 11 states. [2019-09-07 21:08:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:08:44,268 INFO L93 Difference]: Finished difference Result 28460 states and 31776 transitions. [2019-09-07 21:08:44,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 21:08:44,269 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 939 [2019-09-07 21:08:44,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:08:44,315 INFO L225 Difference]: With dead ends: 28460 [2019-09-07 21:08:44,316 INFO L226 Difference]: Without dead ends: 16213 [2019-09-07 21:08:44,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1035 GetRequests, 983 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=450, Invalid=2412, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 21:08:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16213 states. [2019-09-07 21:08:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16213 to 14472. [2019-09-07 21:08:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14472 states. [2019-09-07 21:08:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14472 states to 14472 states and 15196 transitions. [2019-09-07 21:08:44,587 INFO L78 Accepts]: Start accepts. Automaton has 14472 states and 15196 transitions. Word has length 939 [2019-09-07 21:08:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:08:44,587 INFO L475 AbstractCegarLoop]: Abstraction has 14472 states and 15196 transitions. [2019-09-07 21:08:44,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 21:08:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 14472 states and 15196 transitions. [2019-09-07 21:08:44,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1056 [2019-09-07 21:08:44,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:08:44,617 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:08:44,617 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:08:44,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:08:44,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1577008035, now seen corresponding path program 1 times [2019-09-07 21:08:44,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:08:44,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:08:44,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:08:44,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:08:44,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:08:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:08:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1499 backedges. 309 proven. 894 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-09-07 21:08:47,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:08:47,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:08:47,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:08:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:08:47,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:08:47,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:08:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1499 backedges. 1111 proven. 2 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-09-07 21:08:47,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:08:47,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-09-07 21:08:47,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 21:08:47,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 21:08:47,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:08:47,971 INFO L87 Difference]: Start difference. First operand 14472 states and 15196 transitions. Second operand 17 states. [2019-09-07 21:08:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:08:56,281 INFO L93 Difference]: Finished difference Result 32410 states and 34086 transitions. [2019-09-07 21:08:56,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 21:08:56,282 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1055 [2019-09-07 21:08:56,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:08:56,324 INFO L225 Difference]: With dead ends: 32410 [2019-09-07 21:08:56,324 INFO L226 Difference]: Without dead ends: 18281 [2019-09-07 21:08:56,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1144 GetRequests, 1085 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=631, Invalid=2339, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 21:08:56,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18281 states. [2019-09-07 21:08:56,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18281 to 17224. [2019-09-07 21:08:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17224 states. [2019-09-07 21:08:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17224 states to 17224 states and 17963 transitions. [2019-09-07 21:08:56,595 INFO L78 Accepts]: Start accepts. Automaton has 17224 states and 17963 transitions. Word has length 1055 [2019-09-07 21:08:56,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:08:56,596 INFO L475 AbstractCegarLoop]: Abstraction has 17224 states and 17963 transitions. [2019-09-07 21:08:56,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 21:08:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 17224 states and 17963 transitions. [2019-09-07 21:08:56,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1217 [2019-09-07 21:08:56,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:08:56,638 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2019-09-07 21:08:56,638 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:08:56,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:08:56,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1661045522, now seen corresponding path program 1 times [2019-09-07 21:08:56,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:08:56,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:08:56,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:08:56,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:08:56,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:08:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:08:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2292 backedges. 945 proven. 2 refuted. 0 times theorem prover too weak. 1345 trivial. 0 not checked. [2019-09-07 21:08:59,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:08:59,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:08:59,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:08:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:08:59,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 21:08:59,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:08:59,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 21:09:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2292 backedges. 945 proven. 2 refuted. 0 times theorem prover too weak. 1345 trivial. 0 not checked. [2019-09-07 21:09:01,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:09:01,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-09-07 21:09:01,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 21:09:01,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 21:09:01,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:09:01,570 INFO L87 Difference]: Start difference. First operand 17224 states and 17963 transitions. Second operand 17 states. [2019-09-07 21:09:05,498 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-07 21:09:07,307 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-07 21:09:07,802 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-07 21:09:09,180 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-07 21:09:09,390 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-07 21:09:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:09:09,932 INFO L93 Difference]: Finished difference Result 34490 states and 36006 transitions. [2019-09-07 21:09:09,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 21:09:09,933 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1216 [2019-09-07 21:09:09,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:09:09,970 INFO L225 Difference]: With dead ends: 34490 [2019-09-07 21:09:09,971 INFO L226 Difference]: Without dead ends: 17609 [2019-09-07 21:09:09,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1278 GetRequests, 1230 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=502, Invalid=1948, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 21:09:10,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17609 states. [2019-09-07 21:09:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17609 to 17224. [2019-09-07 21:09:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17224 states. [2019-09-07 21:09:10,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17224 states to 17224 states and 17920 transitions. [2019-09-07 21:09:10,234 INFO L78 Accepts]: Start accepts. Automaton has 17224 states and 17920 transitions. Word has length 1216 [2019-09-07 21:09:10,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:09:10,236 INFO L475 AbstractCegarLoop]: Abstraction has 17224 states and 17920 transitions. [2019-09-07 21:09:10,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 21:09:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 17224 states and 17920 transitions. [2019-09-07 21:09:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1380 [2019-09-07 21:09:10,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:09:10,278 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 21:09:10,278 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:09:10,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:09:10,279 INFO L82 PathProgramCache]: Analyzing trace with hash -840337247, now seen corresponding path program 1 times [2019-09-07 21:09:10,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:09:10,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:09:10,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:10,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:10,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2992 backedges. 349 proven. 1937 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2019-09-07 21:09:13,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:09:13,685 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:09:13,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:14,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 1781 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:09:14,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:09:14,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:09:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2992 backedges. 1123 proven. 2 refuted. 0 times theorem prover too weak. 1867 trivial. 0 not checked. [2019-09-07 21:09:15,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:09:15,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2019-09-07 21:09:15,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 21:09:15,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 21:09:15,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-09-07 21:09:15,279 INFO L87 Difference]: Start difference. First operand 17224 states and 17920 transitions. Second operand 19 states. [2019-09-07 21:09:21,465 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-07 21:09:22,060 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-07 21:09:24,115 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-07 21:09:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:09:30,233 INFO L93 Difference]: Finished difference Result 38940 states and 40515 transitions. [2019-09-07 21:09:30,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 21:09:30,234 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1379 [2019-09-07 21:09:30,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:09:30,266 INFO L225 Difference]: With dead ends: 38940 [2019-09-07 21:09:30,266 INFO L226 Difference]: Without dead ends: 21381 [2019-09-07 21:09:30,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1457 GetRequests, 1401 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=644, Invalid=2662, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 21:09:30,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21381 states. [2019-09-07 21:09:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21381 to 19969. [2019-09-07 21:09:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19969 states. [2019-09-07 21:09:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19969 states to 19969 states and 20762 transitions. [2019-09-07 21:09:30,578 INFO L78 Accepts]: Start accepts. Automaton has 19969 states and 20762 transitions. Word has length 1379 [2019-09-07 21:09:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:09:30,578 INFO L475 AbstractCegarLoop]: Abstraction has 19969 states and 20762 transitions. [2019-09-07 21:09:30,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 21:09:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 19969 states and 20762 transitions. [2019-09-07 21:09:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1469 [2019-09-07 21:09:30,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:09:30,627 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2019-09-07 21:09:30,627 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:09:30,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:09:30,628 INFO L82 PathProgramCache]: Analyzing trace with hash 656834098, now seen corresponding path program 1 times [2019-09-07 21:09:30,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:09:30,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:09:30,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:30,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:30,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3886 backedges. 1214 proven. 15 refuted. 0 times theorem prover too weak. 2657 trivial. 0 not checked. [2019-09-07 21:09:33,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:09:33,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:09:33,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:33,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 21:09:33,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:09:33,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:09:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3886 backedges. 2522 proven. 6 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-09-07 21:09:34,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:09:34,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-07 21:09:34,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 21:09:34,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 21:09:34,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-07 21:09:34,733 INFO L87 Difference]: Start difference. First operand 19969 states and 20762 transitions. Second operand 14 states. [2019-09-07 21:09:45,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:09:45,734 INFO L93 Difference]: Finished difference Result 41700 states and 43480 transitions. [2019-09-07 21:09:45,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 21:09:45,735 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1468 [2019-09-07 21:09:45,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:09:45,769 INFO L225 Difference]: With dead ends: 41700 [2019-09-07 21:09:45,769 INFO L226 Difference]: Without dead ends: 22074 [2019-09-07 21:09:45,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1528 GetRequests, 1491 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=271, Invalid=1211, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 21:09:45,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22074 states. [2019-09-07 21:09:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22074 to 21320. [2019-09-07 21:09:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21320 states. [2019-09-07 21:09:46,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21320 states to 21320 states and 22054 transitions. [2019-09-07 21:09:46,049 INFO L78 Accepts]: Start accepts. Automaton has 21320 states and 22054 transitions. Word has length 1468 [2019-09-07 21:09:46,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:09:46,050 INFO L475 AbstractCegarLoop]: Abstraction has 21320 states and 22054 transitions. [2019-09-07 21:09:46,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 21:09:46,051 INFO L276 IsEmpty]: Start isEmpty. Operand 21320 states and 22054 transitions. [2019-09-07 21:09:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1655 [2019-09-07 21:09:46,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:09:46,082 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:09:46,082 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:09:46,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:09:46,083 INFO L82 PathProgramCache]: Analyzing trace with hash 756187626, now seen corresponding path program 1 times [2019-09-07 21:09:46,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:09:46,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:09:46,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:46,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:46,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4311 backedges. 2951 proven. 262 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2019-09-07 21:09:52,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:09:52,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:09:52,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:53,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 2093 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:09:53,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:09:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4311 backedges. 1413 proven. 2 refuted. 0 times theorem prover too weak. 2896 trivial. 0 not checked. [2019-09-07 21:09:54,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:09:54,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 21 [2019-09-07 21:09:54,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 21:09:54,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 21:09:54,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-07 21:09:54,540 INFO L87 Difference]: Start difference. First operand 21320 states and 22054 transitions. Second operand 21 states. [2019-09-07 21:09:57,964 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-07 21:09:58,122 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 21:09:59,492 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-07 21:10:01,723 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-09-07 21:10:02,129 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-07 21:10:02,467 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-09-07 21:10:02,729 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-07 21:10:04,086 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-07 21:10:10,658 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-07 21:10:12,817 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-07 21:10:13,639 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-07 21:10:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:10:15,376 INFO L93 Difference]: Finished difference Result 41401 states and 43103 transitions. [2019-09-07 21:10:15,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-07 21:10:15,376 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1654 [2019-09-07 21:10:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:10:15,428 INFO L225 Difference]: With dead ends: 41401 [2019-09-07 21:10:15,428 INFO L226 Difference]: Without dead ends: 20424 [2019-09-07 21:10:15,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1803 GetRequests, 1706 SyntacticMatches, 7 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2778 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1317, Invalid=7055, Unknown=0, NotChecked=0, Total=8372 [2019-09-07 21:10:15,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20424 states. [2019-09-07 21:10:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20424 to 18519. [2019-09-07 21:10:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18519 states. [2019-09-07 21:10:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18519 states to 18519 states and 18995 transitions. [2019-09-07 21:10:15,666 INFO L78 Accepts]: Start accepts. Automaton has 18519 states and 18995 transitions. Word has length 1654 [2019-09-07 21:10:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:10:15,667 INFO L475 AbstractCegarLoop]: Abstraction has 18519 states and 18995 transitions. [2019-09-07 21:10:15,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 21:10:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 18519 states and 18995 transitions. [2019-09-07 21:10:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2145 [2019-09-07 21:10:15,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:10:15,717 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:10:15,717 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:10:15,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:10:15,718 INFO L82 PathProgramCache]: Analyzing trace with hash 10906134, now seen corresponding path program 1 times [2019-09-07 21:10:15,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:10:15,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:10:15,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:15,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:15,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7896 backedges. 1372 proven. 3795 refuted. 0 times theorem prover too weak. 2729 trivial. 0 not checked. [2019-09-07 21:10:25,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:10:25,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:10:25,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:26,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 2696 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 21:10:26,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:10:26,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:26,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7896 backedges. 4586 proven. 2 refuted. 0 times theorem prover too weak. 3308 trivial. 0 not checked. [2019-09-07 21:10:28,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:10:28,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 5] total 24 [2019-09-07 21:10:28,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 21:10:28,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 21:10:28,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-09-07 21:10:28,063 INFO L87 Difference]: Start difference. First operand 18519 states and 18995 transitions. Second operand 24 states. [2019-09-07 21:10:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:10:50,169 INFO L93 Difference]: Finished difference Result 41873 states and 43143 transitions. [2019-09-07 21:10:50,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-07 21:10:50,169 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2144 [2019-09-07 21:10:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:10:50,208 INFO L225 Difference]: With dead ends: 41873 [2019-09-07 21:10:50,208 INFO L226 Difference]: Without dead ends: 25051 [2019-09-07 21:10:50,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2286 GetRequests, 2193 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2464 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1224, Invalid=6786, Unknown=0, NotChecked=0, Total=8010 [2019-09-07 21:10:50,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25051 states. [2019-09-07 21:10:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25051 to 22931. [2019-09-07 21:10:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22931 states. [2019-09-07 21:10:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22931 states to 22931 states and 23524 transitions. [2019-09-07 21:10:50,507 INFO L78 Accepts]: Start accepts. Automaton has 22931 states and 23524 transitions. Word has length 2144 [2019-09-07 21:10:50,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:10:50,508 INFO L475 AbstractCegarLoop]: Abstraction has 22931 states and 23524 transitions. [2019-09-07 21:10:50,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 21:10:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 22931 states and 23524 transitions. [2019-09-07 21:10:50,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2263 [2019-09-07 21:10:50,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:10:50,574 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:10:50,574 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:10:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:10:50,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1270423850, now seen corresponding path program 1 times [2019-09-07 21:10:50,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:10:50,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:10:50,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:50,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:50,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:58,781 INFO L134 CoverageAnalysis]: Checked inductivity of 8812 backedges. 2034 proven. 1723 refuted. 0 times theorem prover too weak. 5055 trivial. 0 not checked. [2019-09-07 21:10:58,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:10:58,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:10:58,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:59,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 2815 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 21:10:59,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:10:59,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:59,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:59,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:59,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:59,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:59,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:59,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:10:59,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 21:10:59,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 21:10:59,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 21:10:59,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 21:11:03,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8812 backedges. 2066 proven. 2 refuted. 0 times theorem prover too weak. 6744 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 21:11:03,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:11:03,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2019-09-07 21:11:03,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 21:11:03,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 21:11:03,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-07 21:11:03,573 INFO L87 Difference]: Start difference. First operand 22931 states and 23524 transitions. Second operand 21 states. [2019-09-07 21:11:17,706 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2019-09-07 21:11:20,837 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-07 21:11:21,236 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-07 21:11:22,195 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-07 21:11:22,349 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-07 21:11:22,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:11:22,628 INFO L93 Difference]: Finished difference Result 45164 states and 46337 transitions. [2019-09-07 21:11:22,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-07 21:11:22,629 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 2262 [2019-09-07 21:11:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:11:22,667 INFO L225 Difference]: With dead ends: 45164 [2019-09-07 21:11:22,667 INFO L226 Difference]: Without dead ends: 23930 [2019-09-07 21:11:22,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2352 GetRequests, 2282 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1343 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=869, Invalid=3961, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 21:11:22,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23930 states. [2019-09-07 21:11:22,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23930 to 22229. [2019-09-07 21:11:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22229 states. [2019-09-07 21:11:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22229 states to 22229 states and 22776 transitions. [2019-09-07 21:11:22,913 INFO L78 Accepts]: Start accepts. Automaton has 22229 states and 22776 transitions. Word has length 2262 [2019-09-07 21:11:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:11:22,914 INFO L475 AbstractCegarLoop]: Abstraction has 22229 states and 22776 transitions. [2019-09-07 21:11:22,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 21:11:22,914 INFO L276 IsEmpty]: Start isEmpty. Operand 22229 states and 22776 transitions. [2019-09-07 21:11:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2429 [2019-09-07 21:11:22,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:11:22,968 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-07 21:11:22,968 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:11:22,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:11:22,969 INFO L82 PathProgramCache]: Analyzing trace with hash 215485050, now seen corresponding path program 1 times [2019-09-07 21:11:22,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:11:22,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:11:22,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:22,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:22,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 11154 backedges. 1756 proven. 158 refuted. 0 times theorem prover too weak. 9240 trivial. 0 not checked. [2019-09-07 21:11:26,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:11:26,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:11:26,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:26,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 3061 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:11:26,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:11:26,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:26,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:26,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:26,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:26,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:26,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:26,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:26,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:26,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:26,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:11:30,125 INFO L134 CoverageAnalysis]: Checked inductivity of 11154 backedges. 7341 proven. 10 refuted. 0 times theorem prover too weak. 3803 trivial. 0 not checked. [2019-09-07 21:11:30,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:11:30,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2019-09-07 21:11:30,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 21:11:30,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 21:11:30,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-07 21:11:30,134 INFO L87 Difference]: Start difference. First operand 22229 states and 22776 transitions. Second operand 11 states. [2019-09-07 21:11:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:11:36,949 INFO L93 Difference]: Finished difference Result 45091 states and 46270 transitions. [2019-09-07 21:11:36,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 21:11:36,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 2428 [2019-09-07 21:11:36,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:11:36,989 INFO L225 Difference]: With dead ends: 45091 [2019-09-07 21:11:36,990 INFO L226 Difference]: Without dead ends: 24892 [2019-09-07 21:11:37,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2480 GetRequests, 2446 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=1021, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 21:11:37,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24892 states. [2019-09-07 21:11:37,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24892 to 22511. [2019-09-07 21:11:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22511 states. [2019-09-07 21:11:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22511 states to 22511 states and 23012 transitions. [2019-09-07 21:11:37,236 INFO L78 Accepts]: Start accepts. Automaton has 22511 states and 23012 transitions. Word has length 2428 [2019-09-07 21:11:37,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:11:37,237 INFO L475 AbstractCegarLoop]: Abstraction has 22511 states and 23012 transitions. [2019-09-07 21:11:37,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 21:11:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 22511 states and 23012 transitions. [2019-09-07 21:11:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2624 [2019-09-07 21:11:37,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:11:37,290 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:11:37,290 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:11:37,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:11:37,290 INFO L82 PathProgramCache]: Analyzing trace with hash -723467163, now seen corresponding path program 1 times [2019-09-07 21:11:37,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:11:37,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:11:37,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:37,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:37,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12170 backedges. 556 proven. 1745 refuted. 0 times theorem prover too weak. 9869 trivial. 0 not checked. [2019-09-07 21:11:41,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:11:41,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:11:41,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:42,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 3280 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 21:11:42,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:11:42,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:11:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 12170 backedges. 6662 proven. 2 refuted. 0 times theorem prover too weak. 5506 trivial. 0 not checked. [2019-09-07 21:11:44,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:11:44,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:11:44,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:11:44,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:11:44,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:11:44,724 INFO L87 Difference]: Start difference. First operand 22511 states and 23012 transitions. Second operand 9 states. [2019-09-07 21:11:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:11:49,176 INFO L93 Difference]: Finished difference Result 47700 states and 49267 transitions. [2019-09-07 21:11:49,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 21:11:49,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2623 [2019-09-07 21:11:49,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:11:49,253 INFO L225 Difference]: With dead ends: 47700 [2019-09-07 21:11:49,254 INFO L226 Difference]: Without dead ends: 27219 [2019-09-07 21:11:49,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2664 GetRequests, 2636 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2019-09-07 21:11:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27219 states. [2019-09-07 21:11:49,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27219 to 24209. [2019-09-07 21:11:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24209 states. [2019-09-07 21:11:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24209 states to 24209 states and 24780 transitions. [2019-09-07 21:11:49,780 INFO L78 Accepts]: Start accepts. Automaton has 24209 states and 24780 transitions. Word has length 2623 [2019-09-07 21:11:49,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:11:49,781 INFO L475 AbstractCegarLoop]: Abstraction has 24209 states and 24780 transitions. [2019-09-07 21:11:49,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:11:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 24209 states and 24780 transitions. [2019-09-07 21:11:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2638 [2019-09-07 21:11:49,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:11:49,863 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:11:49,863 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:11:49,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:11:49,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1581962507, now seen corresponding path program 1 times [2019-09-07 21:11:49,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:11:49,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:11:49,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:49,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:49,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11817 backedges. 1031 proven. 1837 refuted. 0 times theorem prover too weak. 8949 trivial. 0 not checked. [2019-09-07 21:11:54,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:11:54,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:11:54,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:54,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 3293 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:11:54,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:11:54,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:54,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:12:49,882 WARN L188 SmtUtils]: Spent 52.78 s on a formula simplification. DAG size of input: 162 DAG size of output: 57 [2019-09-07 21:12:49,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:12:52,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:12:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 11817 backedges. 7725 proven. 75 refuted. 0 times theorem prover too weak. 4017 trivial. 0 not checked. [2019-09-07 21:12:54,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:12:54,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-07 21:12:54,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 21:12:54,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 21:12:54,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=149, Unknown=1, NotChecked=0, Total=182 [2019-09-07 21:12:54,742 INFO L87 Difference]: Start difference. First operand 24209 states and 24780 transitions. Second operand 14 states. [2019-09-07 21:14:03,421 WARN L188 SmtUtils]: Spent 1.04 m on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-07 21:14:33,075 WARN L188 SmtUtils]: Spent 24.28 s on a formula simplification that was a NOOP. DAG size: 62 [2019-09-07 21:15:29,054 WARN L188 SmtUtils]: Spent 55.72 s on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-07 21:16:21,715 WARN L188 SmtUtils]: Spent 24.27 s on a formula simplification that was a NOOP. DAG size: 66 [2019-09-07 21:17:24,195 WARN L188 SmtUtils]: Spent 24.25 s on a formula simplification that was a NOOP. DAG size: 69 [2019-09-07 21:17:50,642 WARN L188 SmtUtils]: Spent 24.23 s on a formula simplification that was a NOOP. DAG size: 61 [2019-09-07 21:18:55,758 WARN L188 SmtUtils]: Spent 1.04 m on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-09-07 21:19:13,366 WARN L188 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 81 DAG size of output: 28 [2019-09-07 21:19:19,580 WARN L188 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 64 DAG size of output: 13 [2019-09-07 21:19:24,283 WARN L188 SmtUtils]: Spent 4.63 s on a formula simplification. DAG size of input: 65 DAG size of output: 13