java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label36.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:44:10,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:44:10,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:44:10,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:44:10,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:44:10,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:44:10,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:44:10,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:44:10,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:44:10,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:44:10,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:44:10,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:44:10,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:44:10,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:44:10,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:44:10,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:44:10,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:44:10,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:44:10,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:44:10,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:44:10,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:44:10,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:44:10,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:44:10,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:44:10,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:44:10,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:44:10,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:44:10,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:44:10,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:44:10,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:44:10,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:44:10,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:44:10,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:44:10,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:44:10,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:44:10,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:44:10,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:44:10,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:44:10,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:44:10,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:44:10,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:44:10,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 19:44:10,243 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:44:10,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:44:10,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:44:10,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:44:10,246 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:44:10,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:44:10,247 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:44:10,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:44:10,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:44:10,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:44:10,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:44:10,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:44:10,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:44:10,248 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:44:10,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:44:10,248 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:44:10,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:44:10,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:44:10,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:44:10,249 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:44:10,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:44:10,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:44:10,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:44:10,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:44:10,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:44:10,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:44:10,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:44:10,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:44:10,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:44:10,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:44:10,312 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:44:10,316 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:44:10,317 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:44:10,317 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:44:10,318 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label36.c [2019-09-07 19:44:10,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5cd3157a/20b0390987164ed4ba3008d291bd83e5/FLAG6d09a4236 [2019-09-07 19:44:11,266 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:44:11,267 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label36.c [2019-09-07 19:44:11,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5cd3157a/20b0390987164ed4ba3008d291bd83e5/FLAG6d09a4236 [2019-09-07 19:44:11,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5cd3157a/20b0390987164ed4ba3008d291bd83e5 [2019-09-07 19:44:11,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:44:11,712 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:44:11,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:44:11,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:44:11,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:44:11,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:44:11" (1/1) ... [2019-09-07 19:44:11,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164487eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:44:11, skipping insertion in model container [2019-09-07 19:44:11,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:44:11" (1/1) ... [2019-09-07 19:44:11,730 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:44:11,905 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:44:13,495 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:44:13,507 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:44:14,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:44:14,267 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:44:14,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:44:14 WrapperNode [2019-09-07 19:44:14,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:44:14,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:44:14,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:44:14,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:44:14,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:44:14" (1/1) ... [2019-09-07 19:44:14,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:44:14" (1/1) ... [2019-09-07 19:44:14,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:44:14" (1/1) ... [2019-09-07 19:44:14,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:44:14" (1/1) ... [2019-09-07 19:44:14,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:44:14" (1/1) ... [2019-09-07 19:44:14,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:44:14" (1/1) ... [2019-09-07 19:44:14,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:44:14" (1/1) ... [2019-09-07 19:44:14,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:44:14,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:44:14,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:44:14,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:44:14,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:44:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:44:14,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:44:14,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:44:14,640 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:44:14,641 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:44:14,641 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:44:14,641 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:44:14,642 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:44:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:44:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:44:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:44:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:44:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:44:14,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:44:14,643 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:44:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:44:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:44:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:44:21,031 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:44:21,032 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:44:21,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:44:21 BoogieIcfgContainer [2019-09-07 19:44:21,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:44:21,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:44:21,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:44:21,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:44:21,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:44:11" (1/3) ... [2019-09-07 19:44:21,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34895773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:44:21, skipping insertion in model container [2019-09-07 19:44:21,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:44:14" (2/3) ... [2019-09-07 19:44:21,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34895773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:44:21, skipping insertion in model container [2019-09-07 19:44:21,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:44:21" (3/3) ... [2019-09-07 19:44:21,056 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label36.c [2019-09-07 19:44:21,068 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:44:21,080 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:44:21,099 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:44:21,148 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:44:21,149 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:44:21,149 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:44:21,150 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:44:21,150 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:44:21,150 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:44:21,150 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:44:21,150 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:44:21,150 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:44:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:44:21,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 19:44:21,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:44:21,210 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:44:21,211 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:44:21,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:44:21,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1200737568, now seen corresponding path program 1 times [2019-09-07 19:44:21,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:44:21,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:44:21,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:21,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:44:21,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:44:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:44:21,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:44:21,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:44:21,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:44:21,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:44:21,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:44:21,490 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 19:44:27,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:44:27,806 INFO L93 Difference]: Finished difference Result 3084 states and 5696 transitions. [2019-09-07 19:44:27,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:44:27,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-07 19:44:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:44:27,848 INFO L225 Difference]: With dead ends: 3084 [2019-09-07 19:44:27,849 INFO L226 Difference]: Without dead ends: 1903 [2019-09-07 19:44:27,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:44:27,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2019-09-07 19:44:28,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1897. [2019-09-07 19:44:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1897 states. [2019-09-07 19:44:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 3341 transitions. [2019-09-07 19:44:28,043 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 3341 transitions. Word has length 17 [2019-09-07 19:44:28,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:44:28,044 INFO L475 AbstractCegarLoop]: Abstraction has 1897 states and 3341 transitions. [2019-09-07 19:44:28,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:44:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 3341 transitions. [2019-09-07 19:44:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 19:44:28,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:44:28,053 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:44:28,054 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:44:28,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:44:28,056 INFO L82 PathProgramCache]: Analyzing trace with hash 458891323, now seen corresponding path program 1 times [2019-09-07 19:44:28,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:44:28,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:44:28,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:28,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:44:28,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:44:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:44:28,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:44:28,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:44:28,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:44:28,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:44:28,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:44:28,332 INFO L87 Difference]: Start difference. First operand 1897 states and 3341 transitions. Second operand 6 states. [2019-09-07 19:44:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:44:36,049 INFO L93 Difference]: Finished difference Result 5506 states and 9832 transitions. [2019-09-07 19:44:36,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:44:36,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-07 19:44:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:44:36,075 INFO L225 Difference]: With dead ends: 5506 [2019-09-07 19:44:36,075 INFO L226 Difference]: Without dead ends: 3615 [2019-09-07 19:44:36,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:44:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2019-09-07 19:44:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 3586. [2019-09-07 19:44:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3586 states. [2019-09-07 19:44:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 5675 transitions. [2019-09-07 19:44:36,213 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 5675 transitions. Word has length 93 [2019-09-07 19:44:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:44:36,214 INFO L475 AbstractCegarLoop]: Abstraction has 3586 states and 5675 transitions. [2019-09-07 19:44:36,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:44:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 5675 transitions. [2019-09-07 19:44:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 19:44:36,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:44:36,222 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 19:44:36,223 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:44:36,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:44:36,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1491372947, now seen corresponding path program 1 times [2019-09-07 19:44:36,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:44:36,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:44:36,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:36,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:44:36,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:44:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:44:36,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:44:36,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:44:36,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:44:36,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:44:36,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:44:36,434 INFO L87 Difference]: Start difference. First operand 3586 states and 5675 transitions. Second operand 6 states. [2019-09-07 19:44:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:44:43,657 INFO L93 Difference]: Finished difference Result 10675 states and 17456 transitions. [2019-09-07 19:44:43,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:44:43,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-09-07 19:44:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:44:43,699 INFO L225 Difference]: With dead ends: 10675 [2019-09-07 19:44:43,702 INFO L226 Difference]: Without dead ends: 7095 [2019-09-07 19:44:43,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:44:43,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7095 states. [2019-09-07 19:44:43,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7095 to 7042. [2019-09-07 19:44:43,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7042 states. [2019-09-07 19:44:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7042 states to 7042 states and 10530 transitions. [2019-09-07 19:44:43,934 INFO L78 Accepts]: Start accepts. Automaton has 7042 states and 10530 transitions. Word has length 112 [2019-09-07 19:44:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:44:43,934 INFO L475 AbstractCegarLoop]: Abstraction has 7042 states and 10530 transitions. [2019-09-07 19:44:43,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:44:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand 7042 states and 10530 transitions. [2019-09-07 19:44:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-07 19:44:43,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:44:43,937 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 19:44:43,938 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:44:43,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:44:43,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1805901189, now seen corresponding path program 1 times [2019-09-07 19:44:43,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:44:43,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:44:43,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:43,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:44:43,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:44:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:44:44,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:44:44,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:44:44,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:44:44,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:44:44,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:44:44,187 INFO L87 Difference]: Start difference. First operand 7042 states and 10530 transitions. Second operand 6 states. [2019-09-07 19:44:51,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:44:51,573 INFO L93 Difference]: Finished difference Result 17986 states and 27932 transitions. [2019-09-07 19:44:51,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:44:51,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-09-07 19:44:51,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:44:51,622 INFO L225 Difference]: With dead ends: 17986 [2019-09-07 19:44:51,623 INFO L226 Difference]: Without dead ends: 10950 [2019-09-07 19:44:51,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:44:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10950 states. [2019-09-07 19:44:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10950 to 10780. [2019-09-07 19:44:51,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-09-07 19:44:51,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 15827 transitions. [2019-09-07 19:44:51,901 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 15827 transitions. Word has length 124 [2019-09-07 19:44:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:44:51,903 INFO L475 AbstractCegarLoop]: Abstraction has 10780 states and 15827 transitions. [2019-09-07 19:44:51,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:44:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 15827 transitions. [2019-09-07 19:44:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-07 19:44:51,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:44:51,909 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:44:51,909 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:44:51,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:44:51,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1161776162, now seen corresponding path program 1 times [2019-09-07 19:44:51,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:44:51,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:44:51,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:51,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:44:51,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:44:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 20 proven. 67 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:44:52,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:44:52,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:44:52,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:44:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:44:52,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:44:52,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:44:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 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 19:44:52,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:44:52,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2019-09-07 19:44:52,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:44:52,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:44:52,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:44:52,375 INFO L87 Difference]: Start difference. First operand 10780 states and 15827 transitions. Second operand 6 states. [2019-09-07 19:45:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:45:01,765 INFO L93 Difference]: Finished difference Result 32492 states and 53256 transitions. [2019-09-07 19:45:01,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 19:45:01,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-09-07 19:45:01,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:45:01,884 INFO L225 Difference]: With dead ends: 32492 [2019-09-07 19:45:01,884 INFO L226 Difference]: Without dead ends: 21718 [2019-09-07 19:45:01,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:45:01,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21718 states. [2019-09-07 19:45:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21718 to 21245. [2019-09-07 19:45:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21245 states. [2019-09-07 19:45:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21245 states to 21245 states and 30806 transitions. [2019-09-07 19:45:02,603 INFO L78 Accepts]: Start accepts. Automaton has 21245 states and 30806 transitions. Word has length 178 [2019-09-07 19:45:02,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:45:02,603 INFO L475 AbstractCegarLoop]: Abstraction has 21245 states and 30806 transitions. [2019-09-07 19:45:02,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:45:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 21245 states and 30806 transitions. [2019-09-07 19:45:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-07 19:45:02,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:45:02,607 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:45:02,607 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:45:02,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:45:02,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2049774166, now seen corresponding path program 1 times [2019-09-07 19:45:02,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:45:02,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:45:02,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:02,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:45:02,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:45:02,778 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:45:02,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:45:02,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:45:02,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:45:02,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:45:02,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:45:02,781 INFO L87 Difference]: Start difference. First operand 21245 states and 30806 transitions. Second operand 3 states. [2019-09-07 19:45:08,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:45:08,472 INFO L93 Difference]: Finished difference Result 61259 states and 92641 transitions. [2019-09-07 19:45:08,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:45:08,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-07 19:45:08,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:45:08,640 INFO L225 Difference]: With dead ends: 61259 [2019-09-07 19:45:08,641 INFO L226 Difference]: Without dead ends: 40020 [2019-09-07 19:45:09,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:45:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40020 states. [2019-09-07 19:45:10,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40020 to 39195. [2019-09-07 19:45:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39195 states. [2019-09-07 19:45:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39195 states to 39195 states and 57018 transitions. [2019-09-07 19:45:10,601 INFO L78 Accepts]: Start accepts. Automaton has 39195 states and 57018 transitions. Word has length 187 [2019-09-07 19:45:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:45:10,607 INFO L475 AbstractCegarLoop]: Abstraction has 39195 states and 57018 transitions. [2019-09-07 19:45:10,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:45:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 39195 states and 57018 transitions. [2019-09-07 19:45:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-07 19:45:10,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:45:10,612 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:45:10,612 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:45:10,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:45:10,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2044752557, now seen corresponding path program 1 times [2019-09-07 19:45:10,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:45:10,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:45:10,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:10,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:45:10,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:45:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:45:10,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:45:10,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:45:10,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:45:10,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:45:10,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:45:10,742 INFO L87 Difference]: Start difference. First operand 39195 states and 57018 transitions. Second operand 4 states. [2019-09-07 19:45:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:45:18,014 INFO L93 Difference]: Finished difference Result 84839 states and 122877 transitions. [2019-09-07 19:45:18,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:45:18,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-09-07 19:45:18,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:45:18,145 INFO L225 Difference]: With dead ends: 84839 [2019-09-07 19:45:18,145 INFO L226 Difference]: Without dead ends: 45650 [2019-09-07 19:45:18,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:45:18,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45650 states. [2019-09-07 19:45:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45650 to 43240. [2019-09-07 19:45:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43240 states. [2019-09-07 19:45:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43240 states to 43240 states and 55939 transitions. [2019-09-07 19:45:18,919 INFO L78 Accepts]: Start accepts. Automaton has 43240 states and 55939 transitions. Word has length 211 [2019-09-07 19:45:18,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:45:18,920 INFO L475 AbstractCegarLoop]: Abstraction has 43240 states and 55939 transitions. [2019-09-07 19:45:18,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:45:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 43240 states and 55939 transitions. [2019-09-07 19:45:18,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-07 19:45:18,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:45:18,927 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-09-07 19:45:18,927 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:45:18,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:45:18,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2004739328, now seen corresponding path program 1 times [2019-09-07 19:45:18,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:45:18,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:45:18,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:18,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:45:18,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:45:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 19:45:19,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:45:19,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:45:19,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:45:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:45:19,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:45:19,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:45:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:45:19,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:45:19,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 19:45:19,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:45:19,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:45:19,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:45:19,321 INFO L87 Difference]: Start difference. First operand 43240 states and 55939 transitions. Second operand 8 states. [2019-09-07 19:45:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:45:29,171 INFO L93 Difference]: Finished difference Result 85841 states and 112629 transitions. [2019-09-07 19:45:29,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 19:45:29,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-09-07 19:45:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:45:29,285 INFO L225 Difference]: With dead ends: 85841 [2019-09-07 19:45:29,285 INFO L226 Difference]: Without dead ends: 42607 [2019-09-07 19:45:29,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-07 19:45:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42607 states. [2019-09-07 19:45:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42607 to 35934. [2019-09-07 19:45:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35934 states. [2019-09-07 19:45:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35934 states to 35934 states and 45845 transitions. [2019-09-07 19:45:29,991 INFO L78 Accepts]: Start accepts. Automaton has 35934 states and 45845 transitions. Word has length 242 [2019-09-07 19:45:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:45:29,992 INFO L475 AbstractCegarLoop]: Abstraction has 35934 states and 45845 transitions. [2019-09-07 19:45:29,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:45:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 35934 states and 45845 transitions. [2019-09-07 19:45:30,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-07 19:45:30,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:45:30,016 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:45:30,017 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:45:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:45:30,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1747020495, now seen corresponding path program 1 times [2019-09-07 19:45:30,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:45:30,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:45:30,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:30,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:45:30,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:45:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-07 19:45:30,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:45:30,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:45:30,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:45:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:45:30,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:45:30,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:45:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 19:45:30,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:45:30,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-07 19:45:30,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:45:30,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:45:30,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:45:30,721 INFO L87 Difference]: Start difference. First operand 35934 states and 45845 transitions. Second operand 4 states. [2019-09-07 19:45:40,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:45:40,189 INFO L93 Difference]: Finished difference Result 96991 states and 127217 transitions. [2019-09-07 19:45:40,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:45:40,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 411 [2019-09-07 19:45:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:45:40,377 INFO L225 Difference]: With dead ends: 96991 [2019-09-07 19:45:40,378 INFO L226 Difference]: Without dead ends: 61063 [2019-09-07 19:45:40,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:45:40,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61063 states. [2019-09-07 19:45:41,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61063 to 57820. [2019-09-07 19:45:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57820 states. [2019-09-07 19:45:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57820 states to 57820 states and 72987 transitions. [2019-09-07 19:45:41,457 INFO L78 Accepts]: Start accepts. Automaton has 57820 states and 72987 transitions. Word has length 411 [2019-09-07 19:45:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:45:41,458 INFO L475 AbstractCegarLoop]: Abstraction has 57820 states and 72987 transitions. [2019-09-07 19:45:41,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:45:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 57820 states and 72987 transitions. [2019-09-07 19:45:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-09-07 19:45:41,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:45:41,490 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:45:41,490 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:45:41,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:45:41,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1472890841, now seen corresponding path program 1 times [2019-09-07 19:45:41,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:45:41,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:45:41,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:41,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:45:41,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:45:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 30 proven. 149 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-07 19:45:41,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:45:41,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:45:41,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:45:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:45:41,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:45:41,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:45:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-07 19:45:42,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:45:42,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:45:42,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:45:42,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:45:42,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:45:42,073 INFO L87 Difference]: Start difference. First operand 57820 states and 72987 transitions. Second operand 9 states. [2019-09-07 19:45:54,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:45:54,241 INFO L93 Difference]: Finished difference Result 149101 states and 192752 transitions. [2019-09-07 19:45:54,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 19:45:54,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 448 [2019-09-07 19:45:54,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:45:54,436 INFO L225 Difference]: With dead ends: 149101 [2019-09-07 19:45:54,436 INFO L226 Difference]: Without dead ends: 91287 [2019-09-07 19:45:54,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 460 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-09-07 19:45:54,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91287 states. [2019-09-07 19:45:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91287 to 85542. [2019-09-07 19:45:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85542 states. [2019-09-07 19:45:55,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85542 states to 85542 states and 106878 transitions. [2019-09-07 19:45:55,522 INFO L78 Accepts]: Start accepts. Automaton has 85542 states and 106878 transitions. Word has length 448 [2019-09-07 19:45:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:45:55,522 INFO L475 AbstractCegarLoop]: Abstraction has 85542 states and 106878 transitions. [2019-09-07 19:45:55,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:45:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 85542 states and 106878 transitions. [2019-09-07 19:45:55,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-07 19:45:55,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:45:55,554 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:45:55,554 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:45:55,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:45:55,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1416074856, now seen corresponding path program 1 times [2019-09-07 19:45:55,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:45:55,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:45:55,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:55,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:45:55,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:45:56,503 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 136 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:45:56,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:45:56,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:45:56,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:45:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:45:56,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 19:45:56,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:45:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-07 19:45:56,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:45:56,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 19:45:56,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:45:56,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:45:56,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:45:56,847 INFO L87 Difference]: Start difference. First operand 85542 states and 106878 transitions. Second operand 8 states. [2019-09-07 19:46:16,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:46:16,730 INFO L93 Difference]: Finished difference Result 237260 states and 299793 transitions. [2019-09-07 19:46:16,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 19:46:16,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 487 [2019-09-07 19:46:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:46:17,065 INFO L225 Difference]: With dead ends: 237260 [2019-09-07 19:46:17,065 INFO L226 Difference]: Without dead ends: 151724 [2019-09-07 19:46:17,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 19:46:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151724 states. [2019-09-07 19:46:19,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151724 to 148309. [2019-09-07 19:46:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148309 states. [2019-09-07 19:46:19,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148309 states to 148309 states and 184723 transitions. [2019-09-07 19:46:19,290 INFO L78 Accepts]: Start accepts. Automaton has 148309 states and 184723 transitions. Word has length 487 [2019-09-07 19:46:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:46:19,291 INFO L475 AbstractCegarLoop]: Abstraction has 148309 states and 184723 transitions. [2019-09-07 19:46:19,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:46:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 148309 states and 184723 transitions. [2019-09-07 19:46:19,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2019-09-07 19:46:19,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:46:19,314 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:46:19,314 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:46:19,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:46:19,314 INFO L82 PathProgramCache]: Analyzing trace with hash 836113474, now seen corresponding path program 1 times [2019-09-07 19:46:19,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:46:19,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:46:19,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:19,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:19,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 125 proven. 133 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 19:46:19,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:46:19,641 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:46:19,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:19,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:46:19,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:46:19,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:46:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-07 19:46:20,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:46:20,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 19:46:20,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:46:20,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:46:20,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:46:20,054 INFO L87 Difference]: Start difference. First operand 148309 states and 184723 transitions. Second operand 8 states. [2019-09-07 19:46:37,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:46:37,410 INFO L93 Difference]: Finished difference Result 350521 states and 438995 transitions. [2019-09-07 19:46:37,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 19:46:37,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 519 [2019-09-07 19:46:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:46:37,905 INFO L225 Difference]: With dead ends: 350521 [2019-09-07 19:46:37,905 INFO L226 Difference]: Without dead ends: 203021 [2019-09-07 19:46:38,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-09-07 19:46:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203021 states. [2019-09-07 19:46:40,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203021 to 199616. [2019-09-07 19:46:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199616 states. [2019-09-07 19:46:45,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199616 states to 199616 states and 248446 transitions. [2019-09-07 19:46:46,000 INFO L78 Accepts]: Start accepts. Automaton has 199616 states and 248446 transitions. Word has length 519 [2019-09-07 19:46:46,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:46:46,001 INFO L475 AbstractCegarLoop]: Abstraction has 199616 states and 248446 transitions. [2019-09-07 19:46:46,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:46:46,001 INFO L276 IsEmpty]: Start isEmpty. Operand 199616 states and 248446 transitions. [2019-09-07 19:46:46,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2019-09-07 19:46:46,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:46:46,022 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:46:46,023 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:46:46,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:46:46,023 INFO L82 PathProgramCache]: Analyzing trace with hash -622021255, now seen corresponding path program 1 times [2019-09-07 19:46:46,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:46:46,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:46:46,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:46,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:46,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:46,911 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 91 proven. 352 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-07 19:46:46,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:46:46,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:46:46,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:46:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:47,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 19:46:47,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:46:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 417 proven. 2 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-09-07 19:46:47,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:46:47,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-09-07 19:46:47,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:46:47,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:46:47,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:46:47,417 INFO L87 Difference]: Start difference. First operand 199616 states and 248446 transitions. Second operand 12 states. [2019-09-07 19:47:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:47:39,433 INFO L93 Difference]: Finished difference Result 501396 states and 629553 transitions. [2019-09-07 19:47:39,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 19:47:39,433 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 574 [2019-09-07 19:47:39,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:47:40,292 INFO L225 Difference]: With dead ends: 501396 [2019-09-07 19:47:40,293 INFO L226 Difference]: Without dead ends: 302589 [2019-09-07 19:47:41,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 19:47:41,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302589 states. [2019-09-07 19:47:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302589 to 296976. [2019-09-07 19:47:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296976 states. [2019-09-07 19:47:45,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296976 states to 296976 states and 369528 transitions. [2019-09-07 19:47:45,705 INFO L78 Accepts]: Start accepts. Automaton has 296976 states and 369528 transitions. Word has length 574 [2019-09-07 19:47:45,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:47:45,705 INFO L475 AbstractCegarLoop]: Abstraction has 296976 states and 369528 transitions. [2019-09-07 19:47:45,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 19:47:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 296976 states and 369528 transitions. [2019-09-07 19:47:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2019-09-07 19:47:45,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:47:45,730 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:47:45,730 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:47:45,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:47:45,730 INFO L82 PathProgramCache]: Analyzing trace with hash 435291460, now seen corresponding path program 1 times [2019-09-07 19:47:45,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:47:45,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:47:45,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:45,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:47:45,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 279 proven. 71 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2019-09-07 19:47:50,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:47:50,743 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:47:50,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:47:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:50,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:47:50,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:47:51,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:47:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 597 proven. 2 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-09-07 19:47:51,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:47:51,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2019-09-07 19:47:51,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:47:51,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:47:51,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:47:51,284 INFO L87 Difference]: Start difference. First operand 296976 states and 369528 transitions. Second operand 11 states. [2019-09-07 19:48:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:48:37,915 INFO L93 Difference]: Finished difference Result 688997 states and 863701 transitions. [2019-09-07 19:48:37,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-07 19:48:37,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 632 [2019-09-07 19:48:37,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:48:39,003 INFO L225 Difference]: With dead ends: 688997 [2019-09-07 19:48:39,004 INFO L226 Difference]: Without dead ends: 391046 [2019-09-07 19:48:40,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 712 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4176 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1350, Invalid=9156, Unknown=0, NotChecked=0, Total=10506 [2019-09-07 19:48:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391046 states. [2019-09-07 19:48:45,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391046 to 390047. [2019-09-07 19:48:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390047 states. [2019-09-07 19:48:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390047 states to 390047 states and 471489 transitions. [2019-09-07 19:48:55,840 INFO L78 Accepts]: Start accepts. Automaton has 390047 states and 471489 transitions. Word has length 632 [2019-09-07 19:48:55,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:48:55,840 INFO L475 AbstractCegarLoop]: Abstraction has 390047 states and 471489 transitions. [2019-09-07 19:48:55,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 19:48:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 390047 states and 471489 transitions. [2019-09-07 19:48:55,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2019-09-07 19:48:55,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:48:55,856 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:48:55,857 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:48:55,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:48:55,857 INFO L82 PathProgramCache]: Analyzing trace with hash -931919913, now seen corresponding path program 1 times [2019-09-07 19:48:55,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:48:55,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:48:55,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:55,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:48:55,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 115 proven. 514 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-09-07 19:48:56,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:48:56,485 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) [2019-09-07 19:48:56,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:48:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:57,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:48:57,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:48:57,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:48:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 613 proven. 2 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-09-07 19:48:57,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:48:57,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 19:48:57,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 19:48:57,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 19:48:57,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:48:57,913 INFO L87 Difference]: Start difference. First operand 390047 states and 471489 transitions. Second operand 16 states. [2019-09-07 19:49:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:49:45,093 INFO L93 Difference]: Finished difference Result 860481 states and 1040626 transitions. [2019-09-07 19:49:45,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-07 19:49:45,093 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 641 [2019-09-07 19:49:45,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:49:47,287 INFO L225 Difference]: With dead ends: 860481 [2019-09-07 19:49:47,287 INFO L226 Difference]: Without dead ends: 460127 [2019-09-07 19:49:47,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 722 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4956 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1814, Invalid=10842, Unknown=0, NotChecked=0, Total=12656 [2019-09-07 19:49:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460127 states. [2019-09-07 19:50:04,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460127 to 438007. [2019-09-07 19:50:04,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438007 states. [2019-09-07 19:50:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438007 states to 438007 states and 506822 transitions. [2019-09-07 19:50:04,755 INFO L78 Accepts]: Start accepts. Automaton has 438007 states and 506822 transitions. Word has length 641 [2019-09-07 19:50:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:50:04,755 INFO L475 AbstractCegarLoop]: Abstraction has 438007 states and 506822 transitions. [2019-09-07 19:50:04,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 19:50:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 438007 states and 506822 transitions. [2019-09-07 19:50:04,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2019-09-07 19:50:04,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:04,781 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:50:04,782 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:04,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:04,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2017207086, now seen corresponding path program 1 times [2019-09-07 19:50:04,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:04,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:04,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:04,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:04,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 563 proven. 122 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-07 19:50:13,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:50:13,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:50:13,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:14,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:50:14,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:50:14,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:50:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 672 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 19:50:14,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:50:14,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5] total 22 [2019-09-07 19:50:14,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 19:50:14,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 19:50:14,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-09-07 19:50:14,583 INFO L87 Difference]: Start difference. First operand 438007 states and 506822 transitions. Second operand 22 states. [2019-09-07 19:50:19,958 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-07 19:50:21,133 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-07 19:50:23,606 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-07 19:50:25,098 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-07 19:50:26,862 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-07 19:50:27,088 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-07 19:50:28,059 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-07 19:50:30,843 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-07 19:50:31,363 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-07 19:50:32,928 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-07 19:50:34,604 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-07 19:50:34,824 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2019-09-07 19:50:35,191 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-07 19:50:37,980 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-07 19:50:38,673 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-07 19:50:39,164 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-09-07 19:50:40,188 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-07 19:50:40,943 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-07 19:50:43,619 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-07 19:50:52,160 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2019-09-07 19:50:52,446 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-07 19:50:55,487 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-09-07 19:50:56,405 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-07 19:50:59,444 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-09-07 19:50:59,611 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-07 19:51:00,561 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-07 19:51:20,338 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-09-07 19:51:22,492 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-09-07 19:51:23,376 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-07 19:51:23,820 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-07 19:51:34,940 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-07 19:52:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:52:02,157 INFO L93 Difference]: Finished difference Result 869159 states and 1029385 transitions. [2019-09-07 19:52:02,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 292 states. [2019-09-07 19:52:02,158 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 785 [2019-09-07 19:52:02,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:52:03,381 INFO L225 Difference]: With dead ends: 869159 [2019-09-07 19:52:03,382 INFO L226 Difference]: Without dead ends: 431090 [2019-09-07 19:52:04,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1305 GetRequests, 999 SyntacticMatches, 0 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43060 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=11083, Invalid=83473, Unknown=0, NotChecked=0, Total=94556 [2019-09-07 19:52:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431090 states. [2019-09-07 19:52:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431090 to 409913. [2019-09-07 19:52:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409913 states. [2019-09-07 19:52:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409913 states to 409913 states and 447335 transitions. [2019-09-07 19:52:12,486 INFO L78 Accepts]: Start accepts. Automaton has 409913 states and 447335 transitions. Word has length 785 [2019-09-07 19:52:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:52:12,487 INFO L475 AbstractCegarLoop]: Abstraction has 409913 states and 447335 transitions. [2019-09-07 19:52:12,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 19:52:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 409913 states and 447335 transitions. [2019-09-07 19:52:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 833 [2019-09-07 19:52:12,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:52:12,511 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:52:12,511 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:52:12,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:52:12,512 INFO L82 PathProgramCache]: Analyzing trace with hash 849528872, now seen corresponding path program 1 times [2019-09-07 19:52:12,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:52:12,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:52:12,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:52:12,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:52:12,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:52:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:52:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 557 proven. 7 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-07 19:52:16,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:52:16,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:52:16,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:52:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:52:16,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 19:52:16,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:52:16,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-07 19:52:17,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 19:52:17,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:52:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 630 proven. 2 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-07 19:52:23,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:52:23,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-09-07 19:52:23,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 19:52:23,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 19:52:23,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:52:23,434 INFO L87 Difference]: Start difference. First operand 409913 states and 447335 transitions. Second operand 16 states. [2019-09-07 19:53:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:53:42,244 INFO L93 Difference]: Finished difference Result 982018 states and 1115264 transitions. [2019-09-07 19:53:42,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-09-07 19:53:42,245 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 832 [2019-09-07 19:53:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:53:44,277 INFO L225 Difference]: With dead ends: 982018 [2019-09-07 19:53:44,277 INFO L226 Difference]: Without dead ends: 588989 [2019-09-07 19:53:44,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1097 GetRequests, 945 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9547 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2968, Invalid=20288, Unknown=0, NotChecked=0, Total=23256 [2019-09-07 19:53:44,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588989 states. [2019-09-07 19:53:53,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588989 to 571199. [2019-09-07 19:53:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571199 states. [2019-09-07 19:53:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571199 states to 571199 states and 633994 transitions. [2019-09-07 19:53:55,824 INFO L78 Accepts]: Start accepts. Automaton has 571199 states and 633994 transitions. Word has length 832 [2019-09-07 19:53:55,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:53:55,825 INFO L475 AbstractCegarLoop]: Abstraction has 571199 states and 633994 transitions. [2019-09-07 19:53:55,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 19:53:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 571199 states and 633994 transitions. [2019-09-07 19:53:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2019-09-07 19:53:55,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:53:55,844 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:53:55,845 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:53:55,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:53:55,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2107574485, now seen corresponding path program 1 times [2019-09-07 19:53:55,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:53:55,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:53:55,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:53:55,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:53:55,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:53:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:53:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 225 proven. 88 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2019-09-07 19:53:58,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:53:58,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:53:58,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:53:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:53:58,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:53:58,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:53:58,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:54:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 509 proven. 2 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-09-07 19:54:05,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:54:05,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 19:54:05,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 19:54:05,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 19:54:05,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-07 19:54:05,545 INFO L87 Difference]: Start difference. First operand 571199 states and 633994 transitions. Second operand 10 states. [2019-09-07 19:54:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:54:24,178 INFO L93 Difference]: Finished difference Result 1074390 states and 1191042 transitions. [2019-09-07 19:54:24,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 19:54:24,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 874 [2019-09-07 19:54:24,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:54:25,856 INFO L225 Difference]: With dead ends: 1074390 [2019-09-07 19:54:25,856 INFO L226 Difference]: Without dead ends: 527529 [2019-09-07 19:54:26,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 952 GetRequests, 908 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=392, Invalid=1678, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 19:54:26,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527529 states. [2019-09-07 19:54:39,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527529 to 507667. [2019-09-07 19:54:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507667 states. [2019-09-07 19:54:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507667 states to 507667 states and 548348 transitions. [2019-09-07 19:54:41,368 INFO L78 Accepts]: Start accepts. Automaton has 507667 states and 548348 transitions. Word has length 874 [2019-09-07 19:54:41,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:54:41,369 INFO L475 AbstractCegarLoop]: Abstraction has 507667 states and 548348 transitions. [2019-09-07 19:54:41,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 19:54:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 507667 states and 548348 transitions. [2019-09-07 19:54:41,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1053 [2019-09-07 19:54:41,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:54:41,400 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:54:41,400 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:54:41,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:54:41,401 INFO L82 PathProgramCache]: Analyzing trace with hash 116269109, now seen corresponding path program 1 times [2019-09-07 19:54:41,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:54:41,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:54:41,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:54:41,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:54:41,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:54:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:54:49,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1241 backedges. 434 proven. 456 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-09-07 19:54:49,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:54:49,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:54:49,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:54:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:54:50,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 19:54:50,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:54:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1241 backedges. 987 proven. 2 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-09-07 19:54:50,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:54:50,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-07 19:54:50,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 19:54:50,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 19:54:50,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:54:50,779 INFO L87 Difference]: Start difference. First operand 507667 states and 548348 transitions. Second operand 13 states. [2019-09-07 19:55:16,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:55:16,467 INFO L93 Difference]: Finished difference Result 1033688 states and 1136530 transitions. [2019-09-07 19:55:16,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 19:55:16,467 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1052 [2019-09-07 19:55:16,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:55:18,033 INFO L225 Difference]: With dead ends: 1033688 [2019-09-07 19:55:18,033 INFO L226 Difference]: Without dead ends: 547823 [2019-09-07 19:55:18,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1148 GetRequests, 1094 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=531, Invalid=2549, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 19:55:18,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547823 states. [2019-09-07 19:55:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547823 to 538587. [2019-09-07 19:55:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538587 states. [2019-09-07 19:55:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538587 states to 538587 states and 582592 transitions. [2019-09-07 19:55:37,045 INFO L78 Accepts]: Start accepts. Automaton has 538587 states and 582592 transitions. Word has length 1052 [2019-09-07 19:55:37,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:55:37,046 INFO L475 AbstractCegarLoop]: Abstraction has 538587 states and 582592 transitions. [2019-09-07 19:55:37,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 19:55:37,046 INFO L276 IsEmpty]: Start isEmpty. Operand 538587 states and 582592 transitions. [2019-09-07 19:55:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1208 [2019-09-07 19:55:37,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:55:37,110 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:55:37,110 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:55:37,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:55:37,111 INFO L82 PathProgramCache]: Analyzing trace with hash 304836721, now seen corresponding path program 1 times [2019-09-07 19:55:37,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:55:37,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:55:37,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:55:37,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:55:37,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:55:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat