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/Problem17_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 22:05:38,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 22:05:38,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 22:05:38,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 22:05:38,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 22:05:38,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 22:05:38,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 22:05:38,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 22:05:38,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 22:05:38,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 22:05:38,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 22:05:38,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 22:05:38,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 22:05:38,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 22:05:38,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 22:05:38,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 22:05:38,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 22:05:38,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 22:05:38,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 22:05:38,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 22:05:38,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 22:05:38,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 22:05:38,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 22:05:38,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 22:05:38,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 22:05:38,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 22:05:38,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 22:05:38,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 22:05:38,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 22:05:38,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 22:05:38,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 22:05:38,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 22:05:38,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 22:05:38,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 22:05:38,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 22:05:38,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 22:05:38,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 22:05:38,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 22:05:38,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 22:05:38,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 22:05:38,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 22:05:38,093 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 22:05:38,119 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 22:05:38,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 22:05:38,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 22:05:38,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 22:05:38,122 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 22:05:38,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 22:05:38,123 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 22:05:38,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 22:05:38,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 22:05:38,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 22:05:38,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 22:05:38,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 22:05:38,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 22:05:38,125 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 22:05:38,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 22:05:38,126 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 22:05:38,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 22:05:38,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 22:05:38,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 22:05:38,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 22:05:38,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 22:05:38,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 22:05:38,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 22:05:38,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 22:05:38,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 22:05:38,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 22:05:38,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 22:05:38,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 22:05:38,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 22:05:38,178 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 22:05:38,193 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 22:05:38,196 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 22:05:38,198 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 22:05:38,198 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 22:05:38,199 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label50.c [2019-09-07 22:05:38,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e3e768df/11fd93e00a2749aab2e3b6778bbb183b/FLAG67635670a [2019-09-07 22:05:39,007 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 22:05:39,009 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label50.c [2019-09-07 22:05:39,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e3e768df/11fd93e00a2749aab2e3b6778bbb183b/FLAG67635670a [2019-09-07 22:05:39,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e3e768df/11fd93e00a2749aab2e3b6778bbb183b [2019-09-07 22:05:39,122 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 22:05:39,123 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 22:05:39,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 22:05:39,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 22:05:39,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 22:05:39,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:05:39" (1/1) ... [2019-09-07 22:05:39,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62cb8da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:39, skipping insertion in model container [2019-09-07 22:05:39,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:05:39" (1/1) ... [2019-09-07 22:05:39,141 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 22:05:39,246 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 22:05:40,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:05:40,425 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 22:05:40,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:05:40,907 INFO L192 MainTranslator]: Completed translation [2019-09-07 22:05:40,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:40 WrapperNode [2019-09-07 22:05:40,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 22:05:40,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 22:05:40,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 22:05:40,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 22:05:40,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:40" (1/1) ... [2019-09-07 22:05:40,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:40" (1/1) ... [2019-09-07 22:05:40,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:40" (1/1) ... [2019-09-07 22:05:40,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:40" (1/1) ... [2019-09-07 22:05:41,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:40" (1/1) ... [2019-09-07 22:05:41,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:40" (1/1) ... [2019-09-07 22:05:41,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:40" (1/1) ... [2019-09-07 22:05:41,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 22:05:41,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 22:05:41,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 22:05:41,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 22:05:41,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:40" (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 22:05:41,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 22:05:41,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 22:05:41,257 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 22:05:41,257 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 22:05:41,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 22:05:41,257 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 22:05:41,257 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 22:05:41,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 22:05:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 22:05:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 22:05:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 22:05:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 22:05:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 22:05:45,180 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 22:05:45,181 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 22:05:45,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:05:45 BoogieIcfgContainer [2019-09-07 22:05:45,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 22:05:45,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 22:05:45,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 22:05:45,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 22:05:45,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:05:39" (1/3) ... [2019-09-07 22:05:45,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab3aac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:05:45, skipping insertion in model container [2019-09-07 22:05:45,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:40" (2/3) ... [2019-09-07 22:05:45,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab3aac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:05:45, skipping insertion in model container [2019-09-07 22:05:45,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:05:45" (3/3) ... [2019-09-07 22:05:45,191 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label50.c [2019-09-07 22:05:45,204 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 22:05:45,213 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 22:05:45,234 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 22:05:45,292 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 22:05:45,293 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 22:05:45,294 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 22:05:45,294 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 22:05:45,294 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 22:05:45,294 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 22:05:45,295 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 22:05:45,295 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 22:05:45,295 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 22:05:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states. [2019-09-07 22:05:45,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 22:05:45,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:05:45,344 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:05:45,345 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:05:45,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:05:45,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1447275831, now seen corresponding path program 1 times [2019-09-07 22:05:45,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:05:45,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:05:45,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:45,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:45,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:45,570 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 22:05:45,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:05:45,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:05:45,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:05:45,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:05:45,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:05:45,593 INFO L87 Difference]: Start difference. First operand 603 states. Second operand 3 states. [2019-09-07 22:05:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:05:49,883 INFO L93 Difference]: Finished difference Result 1698 states and 3099 transitions. [2019-09-07 22:05:49,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:05:49,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 22:05:49,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:05:49,911 INFO L225 Difference]: With dead ends: 1698 [2019-09-07 22:05:49,911 INFO L226 Difference]: Without dead ends: 1018 [2019-09-07 22:05:49,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:05:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2019-09-07 22:05:50,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1002. [2019-09-07 22:05:50,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-09-07 22:05:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1699 transitions. [2019-09-07 22:05:50,037 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1699 transitions. Word has length 15 [2019-09-07 22:05:50,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:05:50,038 INFO L475 AbstractCegarLoop]: Abstraction has 1002 states and 1699 transitions. [2019-09-07 22:05:50,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:05:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1699 transitions. [2019-09-07 22:05:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 22:05:50,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:05:50,043 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:05:50,043 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:05:50,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:05:50,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1322012667, now seen corresponding path program 1 times [2019-09-07 22:05:50,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:05:50,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:05:50,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:50,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:50,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:50,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:05:50,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:05:50,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 22:05:50,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 22:05:50,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 22:05:50,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 22:05:50,301 INFO L87 Difference]: Start difference. First operand 1002 states and 1699 transitions. Second operand 5 states. [2019-09-07 22:05:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:05:54,539 INFO L93 Difference]: Finished difference Result 2925 states and 5027 transitions. [2019-09-07 22:05:54,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:05:54,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-07 22:05:54,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:05:54,556 INFO L225 Difference]: With dead ends: 2925 [2019-09-07 22:05:54,556 INFO L226 Difference]: Without dead ends: 1929 [2019-09-07 22:05:54,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:05:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2019-09-07 22:05:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1909. [2019-09-07 22:05:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1909 states. [2019-09-07 22:05:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1909 states and 2977 transitions. [2019-09-07 22:05:54,644 INFO L78 Accepts]: Start accepts. Automaton has 1909 states and 2977 transitions. Word has length 84 [2019-09-07 22:05:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:05:54,646 INFO L475 AbstractCegarLoop]: Abstraction has 1909 states and 2977 transitions. [2019-09-07 22:05:54,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 22:05:54,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 2977 transitions. [2019-09-07 22:05:54,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-07 22:05:54,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:05:54,651 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:05:54,651 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:05:54,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:05:54,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1575122105, now seen corresponding path program 1 times [2019-09-07 22:05:54,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:05:54,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:05:54,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:54,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:54,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:05:54,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:05:54,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:05:54,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:05:54,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:05:54,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:05:54,811 INFO L87 Difference]: Start difference. First operand 1909 states and 2977 transitions. Second operand 6 states. [2019-09-07 22:05:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:05:58,758 INFO L93 Difference]: Finished difference Result 4729 states and 7296 transitions. [2019-09-07 22:05:58,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:05:58,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-07 22:05:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:05:58,776 INFO L225 Difference]: With dead ends: 4729 [2019-09-07 22:05:58,776 INFO L226 Difference]: Without dead ends: 2826 [2019-09-07 22:05:58,781 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 22:05:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2019-09-07 22:05:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2817. [2019-09-07 22:05:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-09-07 22:05:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 3606 transitions. [2019-09-07 22:05:58,857 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 3606 transitions. Word has length 90 [2019-09-07 22:05:58,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:05:58,858 INFO L475 AbstractCegarLoop]: Abstraction has 2817 states and 3606 transitions. [2019-09-07 22:05:58,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:05:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 3606 transitions. [2019-09-07 22:05:58,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-07 22:05:58,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:05:58,861 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:05:58,861 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:05:58,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:05:58,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1807604882, now seen corresponding path program 1 times [2019-09-07 22:05:58,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:05:58,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:05:58,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:58,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:58,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:05:58,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:05:58,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:05:58,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:05:58,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:05:58,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:05:58,974 INFO L87 Difference]: Start difference. First operand 2817 states and 3606 transitions. Second operand 4 states. [2019-09-07 22:06:02,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:02,363 INFO L93 Difference]: Finished difference Result 5628 states and 7224 transitions. [2019-09-07 22:06:02,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:06:02,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-07 22:06:02,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:02,385 INFO L225 Difference]: With dead ends: 5628 [2019-09-07 22:06:02,386 INFO L226 Difference]: Without dead ends: 2817 [2019-09-07 22:06:02,392 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 22:06:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2019-09-07 22:06:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2817. [2019-09-07 22:06:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-09-07 22:06:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 3576 transitions. [2019-09-07 22:06:02,464 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 3576 transitions. Word has length 124 [2019-09-07 22:06:02,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:02,466 INFO L475 AbstractCegarLoop]: Abstraction has 2817 states and 3576 transitions. [2019-09-07 22:06:02,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:06:02,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 3576 transitions. [2019-09-07 22:06:02,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-07 22:06:02,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:02,480 INFO L399 BasicCegarLoop]: trace histogram [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, 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 22:06:02,480 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:02,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:02,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1619140879, now seen corresponding path program 1 times [2019-09-07 22:06:02,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:02,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:02,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:02,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:02,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 22:06:02,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:06:02,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:06:02,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:02,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 22:06:02,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:06:02,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:02,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:03,085 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-09-07 22:06:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 22:06:03,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:06:03,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-09-07 22:06:03,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 22:06:03,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 22:06:03,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:06:03,228 INFO L87 Difference]: Start difference. First operand 2817 states and 3576 transitions. Second operand 10 states. [2019-09-07 22:06:16,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:16,327 INFO L93 Difference]: Finished difference Result 13961 states and 18546 transitions. [2019-09-07 22:06:16,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 22:06:16,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2019-09-07 22:06:16,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:16,385 INFO L225 Difference]: With dead ends: 13961 [2019-09-07 22:06:16,385 INFO L226 Difference]: Without dead ends: 11150 [2019-09-07 22:06:16,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-09-07 22:06:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11150 states. [2019-09-07 22:06:16,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11150 to 10599. [2019-09-07 22:06:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10599 states. [2019-09-07 22:06:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10599 states to 10599 states and 13061 transitions. [2019-09-07 22:06:16,791 INFO L78 Accepts]: Start accepts. Automaton has 10599 states and 13061 transitions. Word has length 177 [2019-09-07 22:06:16,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:16,792 INFO L475 AbstractCegarLoop]: Abstraction has 10599 states and 13061 transitions. [2019-09-07 22:06:16,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 22:06:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 10599 states and 13061 transitions. [2019-09-07 22:06:16,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-07 22:06:16,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:16,796 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:06:16,796 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:16,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:16,797 INFO L82 PathProgramCache]: Analyzing trace with hash 418841054, now seen corresponding path program 1 times [2019-09-07 22:06:16,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:16,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:16,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:16,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:16,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:06:17,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:06:17,019 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 22:06:17,039 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 22:06:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:17,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 22:06:17,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:06:17,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:06:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 22:06:17,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:06:17,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 22:06:17,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:06:17,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:06:17,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:06:17,272 INFO L87 Difference]: Start difference. First operand 10599 states and 13061 transitions. Second operand 9 states. [2019-09-07 22:06:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:30,316 INFO L93 Difference]: Finished difference Result 29573 states and 37701 transitions. [2019-09-07 22:06:30,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 22:06:30,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2019-09-07 22:06:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:30,396 INFO L225 Difference]: With dead ends: 29573 [2019-09-07 22:06:30,401 INFO L226 Difference]: Without dead ends: 18980 [2019-09-07 22:06:30,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2019-09-07 22:06:30,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18980 states. [2019-09-07 22:06:30,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18980 to 17432. [2019-09-07 22:06:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17432 states. [2019-09-07 22:06:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17432 states to 17432 states and 21617 transitions. [2019-09-07 22:06:30,850 INFO L78 Accepts]: Start accepts. Automaton has 17432 states and 21617 transitions. Word has length 199 [2019-09-07 22:06:30,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:30,851 INFO L475 AbstractCegarLoop]: Abstraction has 17432 states and 21617 transitions. [2019-09-07 22:06:30,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:06:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 17432 states and 21617 transitions. [2019-09-07 22:06:30,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-09-07 22:06:30,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:30,872 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 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] [2019-09-07 22:06:30,872 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:30,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:30,873 INFO L82 PathProgramCache]: Analyzing trace with hash 643257366, now seen corresponding path program 1 times [2019-09-07 22:06:30,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:30,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:30,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:30,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:30,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 45 proven. 360 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 22:06:31,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:06:31,836 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 22:06:31,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:31,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:06:32,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:06:32,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:06:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 387 proven. 2 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-07 22:06:32,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:06:32,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 22:06:32,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 22:06:32,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 22:06:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-09-07 22:06:32,167 INFO L87 Difference]: Start difference. First operand 17432 states and 21617 transitions. Second operand 15 states. [2019-09-07 22:06:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:44,079 INFO L93 Difference]: Finished difference Result 45895 states and 56829 transitions. [2019-09-07 22:06:44,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 22:06:44,080 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 351 [2019-09-07 22:06:44,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:44,156 INFO L225 Difference]: With dead ends: 45895 [2019-09-07 22:06:44,157 INFO L226 Difference]: Without dead ends: 27219 [2019-09-07 22:06:44,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 377 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 22:06:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27219 states. [2019-09-07 22:06:44,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27219 to 22769. [2019-09-07 22:06:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22769 states. [2019-09-07 22:06:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22769 states to 22769 states and 26714 transitions. [2019-09-07 22:06:44,625 INFO L78 Accepts]: Start accepts. Automaton has 22769 states and 26714 transitions. Word has length 351 [2019-09-07 22:06:44,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:44,626 INFO L475 AbstractCegarLoop]: Abstraction has 22769 states and 26714 transitions. [2019-09-07 22:06:44,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 22:06:44,626 INFO L276 IsEmpty]: Start isEmpty. Operand 22769 states and 26714 transitions. [2019-09-07 22:06:44,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-09-07 22:06:44,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:44,634 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 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] [2019-09-07 22:06:44,635 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:44,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:44,635 INFO L82 PathProgramCache]: Analyzing trace with hash 990103624, now seen corresponding path program 1 times [2019-09-07 22:06:44,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:44,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:44,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:44,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:44,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-09-07 22:06:45,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:06:45,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:06:45,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:06:45,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:06:45,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:06:45,013 INFO L87 Difference]: Start difference. First operand 22769 states and 26714 transitions. Second operand 3 states. [2019-09-07 22:06:47,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:47,927 INFO L93 Difference]: Finished difference Result 54509 states and 65145 transitions. [2019-09-07 22:06:47,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:06:47,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2019-09-07 22:06:47,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:48,057 INFO L225 Difference]: With dead ends: 54509 [2019-09-07 22:06:48,058 INFO L226 Difference]: Without dead ends: 33500 [2019-09-07 22:06:48,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:06:48,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33500 states. [2019-09-07 22:06:48,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33500 to 32593. [2019-09-07 22:06:48,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32593 states. [2019-09-07 22:06:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32593 states to 32593 states and 39106 transitions. [2019-09-07 22:06:48,794 INFO L78 Accepts]: Start accepts. Automaton has 32593 states and 39106 transitions. Word has length 362 [2019-09-07 22:06:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:48,795 INFO L475 AbstractCegarLoop]: Abstraction has 32593 states and 39106 transitions. [2019-09-07 22:06:48,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:06:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 32593 states and 39106 transitions. [2019-09-07 22:06:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-07 22:06:48,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:48,815 INFO L399 BasicCegarLoop]: trace histogram [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, 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] [2019-09-07 22:06:48,816 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:48,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:48,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1678266673, now seen corresponding path program 1 times [2019-09-07 22:06:48,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:48,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:48,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:48,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:48,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:49,365 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 113 proven. 107 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 22:06:49,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:06:49,365 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 22:06:49,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:49,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:06:49,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:06:49,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 294 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 22:06:49,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:06:49,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 22:06:49,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:06:49,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:06:49,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:06:49,643 INFO L87 Difference]: Start difference. First operand 32593 states and 39106 transitions. Second operand 6 states. [2019-09-07 22:06:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:54,400 INFO L93 Difference]: Finished difference Result 91581 states and 112748 transitions. [2019-09-07 22:06:54,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 22:06:54,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 387 [2019-09-07 22:06:54,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:54,566 INFO L225 Difference]: With dead ends: 91581 [2019-09-07 22:06:54,566 INFO L226 Difference]: Without dead ends: 55460 [2019-09-07 22:06:54,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 391 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 22:06:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55460 states. [2019-09-07 22:06:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55460 to 50921. [2019-09-07 22:06:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50921 states. [2019-09-07 22:06:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50921 states to 50921 states and 60833 transitions. [2019-09-07 22:06:55,446 INFO L78 Accepts]: Start accepts. Automaton has 50921 states and 60833 transitions. Word has length 387 [2019-09-07 22:06:55,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:55,446 INFO L475 AbstractCegarLoop]: Abstraction has 50921 states and 60833 transitions. [2019-09-07 22:06:55,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:06:55,446 INFO L276 IsEmpty]: Start isEmpty. Operand 50921 states and 60833 transitions. [2019-09-07 22:06:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-07 22:06:55,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:55,460 INFO L399 BasicCegarLoop]: trace histogram [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, 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] [2019-09-07 22:06:55,460 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:55,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:55,461 INFO L82 PathProgramCache]: Analyzing trace with hash -517094413, now seen corresponding path program 1 times [2019-09-07 22:06:55,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:55,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:55,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:55,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:55,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 221 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 22:06:56,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:06:56,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:06:56,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:56,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 22:06:56,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:06:57,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:57,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:57,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:06:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 296 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 22:06:57,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:06:57,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-09-07 22:06:57,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 22:06:57,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 22:06:57,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-07 22:06:57,260 INFO L87 Difference]: Start difference. First operand 50921 states and 60833 transitions. Second operand 12 states. [2019-09-07 22:07:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:07:31,460 INFO L93 Difference]: Finished difference Result 171556 states and 236946 transitions. [2019-09-07 22:07:31,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-07 22:07:31,461 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 389 [2019-09-07 22:07:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:07:32,294 INFO L225 Difference]: With dead ends: 171556 [2019-09-07 22:07:32,294 INFO L226 Difference]: Without dead ends: 114867 [2019-09-07 22:07:32,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5394 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1886, Invalid=11920, Unknown=0, NotChecked=0, Total=13806 [2019-09-07 22:07:32,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114867 states. [2019-09-07 22:07:34,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114867 to 104420. [2019-09-07 22:07:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104420 states. [2019-09-07 22:07:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104420 states to 104420 states and 130525 transitions. [2019-09-07 22:07:34,787 INFO L78 Accepts]: Start accepts. Automaton has 104420 states and 130525 transitions. Word has length 389 [2019-09-07 22:07:34,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:07:34,788 INFO L475 AbstractCegarLoop]: Abstraction has 104420 states and 130525 transitions. [2019-09-07 22:07:34,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 22:07:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 104420 states and 130525 transitions. [2019-09-07 22:07:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-09-07 22:07:34,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:07:34,801 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:07:34,801 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:07:34,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:07:34,802 INFO L82 PathProgramCache]: Analyzing trace with hash -815989013, now seen corresponding path program 1 times [2019-09-07 22:07:34,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:07:34,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:07:34,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:34,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:07:34,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 26 proven. 122 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-09-07 22:07:35,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:07:35,756 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 22:07:35,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:07:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:35,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 22:07:35,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:07:35,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:35,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 264 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 22:07:36,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:07:36,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-07 22:07:36,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 22:07:36,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 22:07:36,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-07 22:07:36,056 INFO L87 Difference]: Start difference. First operand 104420 states and 130525 transitions. Second operand 13 states. [2019-09-07 22:07:58,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:07:58,217 INFO L93 Difference]: Finished difference Result 238927 states and 310116 transitions. [2019-09-07 22:07:58,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 22:07:58,218 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 432 [2019-09-07 22:07:58,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:07:58,647 INFO L225 Difference]: With dead ends: 238927 [2019-09-07 22:07:58,647 INFO L226 Difference]: Without dead ends: 133637 [2019-09-07 22:07:58,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 484 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1617 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=719, Invalid=4251, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 22:07:58,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133637 states. [2019-09-07 22:08:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133637 to 124271. [2019-09-07 22:08:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124271 states. [2019-09-07 22:08:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124271 states to 124271 states and 157349 transitions. [2019-09-07 22:08:03,605 INFO L78 Accepts]: Start accepts. Automaton has 124271 states and 157349 transitions. Word has length 432 [2019-09-07 22:08:03,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:08:03,606 INFO L475 AbstractCegarLoop]: Abstraction has 124271 states and 157349 transitions. [2019-09-07 22:08:03,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 22:08:03,606 INFO L276 IsEmpty]: Start isEmpty. Operand 124271 states and 157349 transitions. [2019-09-07 22:08:03,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-09-07 22:08:03,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:08:03,627 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:08:03,627 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:08:03,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:08:03,628 INFO L82 PathProgramCache]: Analyzing trace with hash -175343770, now seen corresponding path program 1 times [2019-09-07 22:08:03,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:08:03,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:08:03,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:03,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:08:03,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:08:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2019-09-07 22:08:03,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:08:03,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:08:03,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:08:03,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:08:03,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:08:03,881 INFO L87 Difference]: Start difference. First operand 124271 states and 157349 transitions. Second operand 3 states. [2019-09-07 22:08:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:08:08,231 INFO L93 Difference]: Finished difference Result 235654 states and 300312 transitions. [2019-09-07 22:08:08,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:08:08,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 473 [2019-09-07 22:08:08,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:08:08,558 INFO L225 Difference]: With dead ends: 235654 [2019-09-07 22:08:08,558 INFO L226 Difference]: Without dead ends: 109587 [2019-09-07 22:08:08,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:08:08,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109587 states. [2019-09-07 22:08:09,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109587 to 101212. [2019-09-07 22:08:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101212 states. [2019-09-07 22:08:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101212 states to 101212 states and 126987 transitions. [2019-09-07 22:08:09,945 INFO L78 Accepts]: Start accepts. Automaton has 101212 states and 126987 transitions. Word has length 473 [2019-09-07 22:08:09,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:08:09,946 INFO L475 AbstractCegarLoop]: Abstraction has 101212 states and 126987 transitions. [2019-09-07 22:08:09,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:08:09,946 INFO L276 IsEmpty]: Start isEmpty. Operand 101212 states and 126987 transitions. [2019-09-07 22:08:09,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-09-07 22:08:09,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:08:09,966 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:08:09,966 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:08:09,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:08:09,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1771865427, now seen corresponding path program 1 times [2019-09-07 22:08:09,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:08:09,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:08:09,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:09,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:08:09,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:08:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 335 proven. 2 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-07 22:08:10,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:08:10,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:08:10,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:08:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:08:10,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 22:08:10,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:08:10,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:08:10,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:08:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 335 proven. 2 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-07 22:08:11,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:08:11,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-09-07 22:08:11,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:08:11,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:08:11,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:08:11,321 INFO L87 Difference]: Start difference. First operand 101212 states and 126987 transitions. Second operand 8 states. [2019-09-07 22:08:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:08:17,095 INFO L93 Difference]: Finished difference Result 199429 states and 253382 transitions. [2019-09-07 22:08:17,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 22:08:17,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 492 [2019-09-07 22:08:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:08:17,333 INFO L225 Difference]: With dead ends: 199429 [2019-09-07 22:08:17,333 INFO L226 Difference]: Without dead ends: 114608 [2019-09-07 22:08:17,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-09-07 22:08:17,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114608 states. [2019-09-07 22:08:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114608 to 111462. [2019-09-07 22:08:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111462 states. [2019-09-07 22:08:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111462 states to 111462 states and 139220 transitions. [2019-09-07 22:08:21,509 INFO L78 Accepts]: Start accepts. Automaton has 111462 states and 139220 transitions. Word has length 492 [2019-09-07 22:08:21,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:08:21,510 INFO L475 AbstractCegarLoop]: Abstraction has 111462 states and 139220 transitions. [2019-09-07 22:08:21,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:08:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 111462 states and 139220 transitions. [2019-09-07 22:08:21,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-09-07 22:08:21,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:08:21,531 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:08:21,531 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:08:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:08:21,531 INFO L82 PathProgramCache]: Analyzing trace with hash -209489604, now seen corresponding path program 1 times [2019-09-07 22:08:21,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:08:21,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:08:21,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:21,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:08:21,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:08:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2019-09-07 22:08:21,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:08:21,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:08:21,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:08:21,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:08:21,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:08:21,800 INFO L87 Difference]: Start difference. First operand 111462 states and 139220 transitions. Second operand 4 states. [2019-09-07 22:08:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:08:28,404 INFO L93 Difference]: Finished difference Result 279790 states and 355446 transitions. [2019-09-07 22:08:28,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:08:28,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 507 [2019-09-07 22:08:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:08:28,773 INFO L225 Difference]: With dead ends: 279790 [2019-09-07 22:08:28,774 INFO L226 Difference]: Without dead ends: 169222 [2019-09-07 22:08:28,922 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 22:08:29,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169222 states. [2019-09-07 22:08:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169222 to 161790. [2019-09-07 22:08:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161790 states. [2019-09-07 22:08:31,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161790 states to 161790 states and 198912 transitions. [2019-09-07 22:08:31,457 INFO L78 Accepts]: Start accepts. Automaton has 161790 states and 198912 transitions. Word has length 507 [2019-09-07 22:08:31,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:08:31,458 INFO L475 AbstractCegarLoop]: Abstraction has 161790 states and 198912 transitions. [2019-09-07 22:08:31,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:08:31,458 INFO L276 IsEmpty]: Start isEmpty. Operand 161790 states and 198912 transitions. [2019-09-07 22:08:31,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2019-09-07 22:08:31,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:08:31,482 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:08:31,482 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:08:31,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:08:31,482 INFO L82 PathProgramCache]: Analyzing trace with hash 710517272, now seen corresponding path program 1 times [2019-09-07 22:08:31,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:08:31,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:08:31,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:31,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:08:31,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:08:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 377 proven. 230 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2019-09-07 22:08:31,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:08:31,896 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 22:08:32,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:08:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:08:32,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 22:08:32,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:08:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 656 proven. 2 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-09-07 22:08:32,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:08:32,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-09-07 22:08:32,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 22:08:32,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 22:08:32,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:08:32,870 INFO L87 Difference]: Start difference. First operand 161790 states and 198912 transitions. Second operand 10 states. [2019-09-07 22:08:48,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:08:48,230 INFO L93 Difference]: Finished difference Result 386573 states and 527698 transitions. [2019-09-07 22:08:48,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 22:08:48,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 577 [2019-09-07 22:08:48,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:08:48,952 INFO L225 Difference]: With dead ends: 386573 [2019-09-07 22:08:48,952 INFO L226 Difference]: Without dead ends: 243349 [2019-09-07 22:08:49,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=545, Unknown=0, NotChecked=0, Total=756 [2019-09-07 22:08:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243349 states. [2019-09-07 22:08:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243349 to 229819. [2019-09-07 22:08:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229819 states. [2019-09-07 22:08:57,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229819 states to 229819 states and 281512 transitions. [2019-09-07 22:08:57,040 INFO L78 Accepts]: Start accepts. Automaton has 229819 states and 281512 transitions. Word has length 577 [2019-09-07 22:08:57,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:08:57,041 INFO L475 AbstractCegarLoop]: Abstraction has 229819 states and 281512 transitions. [2019-09-07 22:08:57,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 22:08:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand 229819 states and 281512 transitions. [2019-09-07 22:08:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2019-09-07 22:08:57,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:08:57,060 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-07 22:08:57,061 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:08:57,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:08:57,061 INFO L82 PathProgramCache]: Analyzing trace with hash 875813581, now seen corresponding path program 1 times [2019-09-07 22:08:57,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:08:57,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:08:57,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:57,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:08:57,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:08:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 351 proven. 151 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2019-09-07 22:08:57,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:08:57,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:08:57,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:08:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:08:57,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 944 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 22:08:57,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:08:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 732 proven. 2 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-09-07 22:08:57,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:08:57,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 22:08:57,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:08:57,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:08:57,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:08:57,846 INFO L87 Difference]: Start difference. First operand 229819 states and 281512 transitions. Second operand 8 states. [2019-09-07 22:09:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:09:12,770 INFO L93 Difference]: Finished difference Result 491943 states and 603863 transitions. [2019-09-07 22:09:12,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 22:09:12,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 592 [2019-09-07 22:09:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:09:13,402 INFO L225 Difference]: With dead ends: 491943 [2019-09-07 22:09:13,402 INFO L226 Difference]: Without dead ends: 257690 [2019-09-07 22:09:13,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=1519, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 22:09:13,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257690 states. [2019-09-07 22:09:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257690 to 250089. [2019-09-07 22:09:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250089 states. [2019-09-07 22:09:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250089 states to 250089 states and 299710 transitions. [2019-09-07 22:09:18,041 INFO L78 Accepts]: Start accepts. Automaton has 250089 states and 299710 transitions. Word has length 592 [2019-09-07 22:09:18,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:09:18,042 INFO L475 AbstractCegarLoop]: Abstraction has 250089 states and 299710 transitions. [2019-09-07 22:09:18,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:09:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 250089 states and 299710 transitions. [2019-09-07 22:09:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2019-09-07 22:09:18,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:09:18,063 INFO L399 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:09:18,063 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:09:18,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:09:18,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1737351693, now seen corresponding path program 1 times [2019-09-07 22:09:18,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:09:18,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:09:18,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:09:18,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:09:18,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:09:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:09:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 608 proven. 28 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-09-07 22:09:18,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:09:18,734 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 22:09:18,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:09:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:09:18,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:09:18,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:09:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 562 proven. 6 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2019-09-07 22:09:23,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:09:23,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2019-09-07 22:09:23,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 22:09:23,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 22:09:23,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-07 22:09:23,201 INFO L87 Difference]: Start difference. First operand 250089 states and 299710 transitions. Second operand 15 states. [2019-09-07 22:09:45,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:09:45,993 INFO L93 Difference]: Finished difference Result 580456 states and 695967 transitions. [2019-09-07 22:09:45,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-07 22:09:45,994 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 593 [2019-09-07 22:09:45,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:09:47,454 INFO L225 Difference]: With dead ends: 580456 [2019-09-07 22:09:47,455 INFO L226 Difference]: Without dead ends: 320319 [2019-09-07 22:09:47,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=701, Invalid=3081, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 22:09:47,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320319 states. [2019-09-07 22:09:55,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320319 to 293801. [2019-09-07 22:09:55,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293801 states. [2019-09-07 22:09:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293801 states to 293801 states and 350628 transitions. [2019-09-07 22:09:56,165 INFO L78 Accepts]: Start accepts. Automaton has 293801 states and 350628 transitions. Word has length 593 [2019-09-07 22:09:56,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:09:56,165 INFO L475 AbstractCegarLoop]: Abstraction has 293801 states and 350628 transitions. [2019-09-07 22:09:56,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 22:09:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 293801 states and 350628 transitions. [2019-09-07 22:09:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-09-07 22:09:56,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:09:56,182 INFO L399 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:09:56,182 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:09:56,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:09:56,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1837718471, now seen corresponding path program 1 times [2019-09-07 22:09:56,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:09:56,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:09:56,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:09:56,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:09:56,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:09:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:09:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 343 proven. 2 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2019-09-07 22:09:56,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:09:56,584 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 22:09:56,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:09:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:09:56,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 22:09:56,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:09:56,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:09:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 568 proven. 2 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-07 22:09:57,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:09:57,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 22:09:57,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:09:57,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:09:57,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:09:57,117 INFO L87 Difference]: Start difference. First operand 293801 states and 350628 transitions. Second operand 8 states. [2019-09-07 22:10:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:10:13,808 INFO L93 Difference]: Finished difference Result 658062 states and 789509 transitions. [2019-09-07 22:10:13,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 22:10:13,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 600 [2019-09-07 22:10:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:10:14,738 INFO L225 Difference]: With dead ends: 658062 [2019-09-07 22:10:14,738 INFO L226 Difference]: Without dead ends: 361525 [2019-09-07 22:10:15,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 631 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=342, Invalid=1464, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 22:10:15,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361525 states. [2019-09-07 22:10:20,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361525 to 349882. [2019-09-07 22:10:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349882 states. [2019-09-07 22:10:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349882 states to 349882 states and 412523 transitions. [2019-09-07 22:10:21,566 INFO L78 Accepts]: Start accepts. Automaton has 349882 states and 412523 transitions. Word has length 600 [2019-09-07 22:10:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:10:21,566 INFO L475 AbstractCegarLoop]: Abstraction has 349882 states and 412523 transitions. [2019-09-07 22:10:21,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:10:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 349882 states and 412523 transitions. [2019-09-07 22:10:21,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2019-09-07 22:10:21,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:10:21,592 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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 22:10:21,593 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:10:21,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:10:21,593 INFO L82 PathProgramCache]: Analyzing trace with hash 18279278, now seen corresponding path program 1 times [2019-09-07 22:10:21,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:10:21,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:10:21,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:10:21,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:10:21,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:10:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:10:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 494 proven. 2 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2019-09-07 22:10:26,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:10:26,806 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 22:10:26,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:10:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:10:26,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 22:10:26,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:10:27,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 22:10:27,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:10:27,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:10:27,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:10:27,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:10:27,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:10:27,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:10:27,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:10:27,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:10:27,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 22:10:27,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:10:27,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 22:10:27,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:10:27,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:10:27,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:10:27,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:10:27,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:10:27,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:10:27,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:10:28,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 698 proven. 250 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-07 22:10:28,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:10:28,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 17 [2019-09-07 22:10:28,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 22:10:28,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 22:10:28,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-07 22:10:28,016 INFO L87 Difference]: Start difference. First operand 349882 states and 412523 transitions. Second operand 17 states. [2019-09-07 22:10:35,080 WARN L188 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-07 22:10:36,711 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-09-07 22:10:39,050 WARN L188 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-07 22:10:39,893 WARN L188 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-09-07 22:10:42,783 WARN L188 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 47 DAG size of output: 33 [2019-09-07 22:10:43,738 WARN L188 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 37 [2019-09-07 22:10:45,471 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2019-09-07 22:10:46,946 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-09-07 22:10:49,422 WARN L188 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-09-07 22:10:52,041 WARN L188 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-07 22:10:52,965 WARN L188 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-09-07 22:10:54,499 WARN L188 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-07 22:11:02,238 WARN L188 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-09-07 22:11:03,620 WARN L188 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-07 22:11:06,128 WARN L188 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-09-07 22:11:09,703 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 22:11:13,043 WARN L188 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-07 22:11:14,439 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-09-07 22:11:19,873 WARN L188 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 22:11:22,515 WARN L188 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-07 22:11:24,115 WARN L188 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-07 22:11:28,196 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2019-09-07 22:11:30,989 WARN L188 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-07 22:11:33,058 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-07 22:11:35,782 WARN L188 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-07 22:11:37,921 WARN L188 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-09-07 22:11:48,986 WARN L188 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-07 22:11:54,004 WARN L188 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-09-07 22:11:55,843 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-07 22:11:56,657 WARN L188 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-07 22:12:08,913 WARN L188 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-07 22:12:09,826 WARN L188 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-09-07 22:12:10,977 WARN L188 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-09-07 22:12:13,229 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-07 22:12:15,168 WARN L188 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-09-07 22:12:17,866 WARN L188 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 42 [2019-09-07 22:12:26,196 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-07 22:12:27,410 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-07 22:12:28,504 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-09-07 22:12:29,839 WARN L188 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-07 22:12:31,092 WARN L188 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2019-09-07 22:12:33,481 WARN L188 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-07 22:12:38,216 WARN L188 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-07 22:12:39,154 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-09-07 22:12:40,958 WARN L188 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-07 22:12:47,215 WARN L188 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-07 22:12:51,498 WARN L188 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-07 22:12:52,868 WARN L188 SmtUtils]: Spent 995.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-07 22:12:54,289 WARN L188 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-07 22:13:02,515 WARN L188 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-09-07 22:13:04,884 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-09-07 22:13:15,510 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-09-07 22:13:27,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:13:27,184 INFO L93 Difference]: Finished difference Result 774896 states and 908951 transitions. [2019-09-07 22:13:27,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2019-09-07 22:13:27,184 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 649 [2019-09-07 22:13:27,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:13:29,146 INFO L225 Difference]: With dead ends: 774896 [2019-09-07 22:13:29,146 INFO L226 Difference]: Without dead ends: 427651 [2019-09-07 22:13:29,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1043 GetRequests, 804 SyntacticMatches, 2 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24936 ImplicationChecksByTransitivity, 63.5s TimeCoverageRelationStatistics Valid=4930, Invalid=51952, Unknown=0, NotChecked=0, Total=56882 [2019-09-07 22:13:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427651 states. [2019-09-07 22:13:36,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427651 to 396548. [2019-09-07 22:13:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396548 states. [2019-09-07 22:13:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396548 states to 396548 states and 442965 transitions. [2019-09-07 22:13:39,288 INFO L78 Accepts]: Start accepts. Automaton has 396548 states and 442965 transitions. Word has length 649 [2019-09-07 22:13:39,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:13:39,288 INFO L475 AbstractCegarLoop]: Abstraction has 396548 states and 442965 transitions. [2019-09-07 22:13:39,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 22:13:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 396548 states and 442965 transitions. [2019-09-07 22:13:39,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-09-07 22:13:39,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:13:39,306 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:13:39,307 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:13:39,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:13:39,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1933294567, now seen corresponding path program 1 times [2019-09-07 22:13:39,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:13:39,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:13:39,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:13:39,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:13:39,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:13:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:13:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 801 proven. 28 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-07 22:13:45,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:13:45,568 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 22:13:45,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:13:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:13:45,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:13:45,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:13:45,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:45,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:45,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:45,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:45,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:45,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:45,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:47,059 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_7 Int)) (let ((.cse0 (mod v_prenex_7 299849))) (and (<= 0 v_prenex_7) (= (mod .cse0 5) 0) (<= c_~a28~0 (+ (div (+ .cse0 300150) 5) 150493))))) (exists ((v_~a28~0_1315 Int)) (let ((.cse1 (mod v_~a28~0_1315 299849))) (let ((.cse2 (+ .cse1 301))) (and (not (= .cse1 0)) (< v_~a28~0_1315 0) (<= 0 .cse2) (<= c_~a28~0 (+ (div .cse2 5) 150493)))))) (exists ((v_prenex_7 Int)) (let ((.cse3 (+ (mod v_prenex_7 299849) 300150))) (and (<= 0 v_prenex_7) (<= 0 .cse3) (<= c_~a28~0 (+ (div .cse3 5) 150493))))) (exists ((v_prenex_7 Int)) (let ((.cse5 (mod v_prenex_7 299849))) (let ((.cse4 (+ .cse5 300150))) (and (<= 0 .cse4) (<= c_~a28~0 (+ (div .cse4 5) 150493)) (= .cse5 0))))) (exists ((v_prenex_7 Int)) (let ((.cse7 (mod v_prenex_7 299849))) (let ((.cse6 (+ .cse7 300150))) (and (<= 0 v_prenex_7) (<= c_~a28~0 (+ (div .cse6 5) 150494)) (not (= (mod .cse7 5) 0)) (< .cse6 0))))) (exists ((v_~a28~0_1315 Int)) (let ((.cse9 (mod v_~a28~0_1315 299849))) (let ((.cse8 (+ .cse9 301))) (and (< .cse8 0) (not (= 0 (mod (+ .cse9 1) 5))) (not (= .cse9 0)) (< v_~a28~0_1315 0) (<= c_~a28~0 (+ (div .cse8 5) 150494)))))) (exists ((v_prenex_7 Int)) (let ((.cse10 (mod v_prenex_7 299849))) (and (= (mod .cse10 5) 0) (<= c_~a28~0 (+ (div (+ .cse10 300150) 5) 150493)) (= .cse10 0)))) (exists ((v_~a28~0_1315 Int)) (let ((.cse11 (mod v_~a28~0_1315 299849))) (and (not (= .cse11 0)) (< v_~a28~0_1315 0) (= 0 (mod (+ .cse11 1) 5)) (<= c_~a28~0 (+ (div (+ .cse11 301) 5) 150493))))) (exists ((v_prenex_7 Int)) (let ((.cse13 (mod v_prenex_7 299849))) (let ((.cse12 (+ .cse13 300150))) (and (<= c_~a28~0 (+ (div .cse12 5) 150494)) (= .cse13 0) (not (= (mod .cse13 5) 0)) (< .cse12 0)))))) is different from true [2019-09-07 22:13:48,211 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_9 Int)) (let ((.cse1 (mod v_prenex_9 299849))) (let ((.cse0 (+ .cse1 300150))) (and (<= c_~a28~0 (+ (div .cse0 5) 150493)) (= .cse1 0) (<= 0 .cse0))))) (exists ((v_prenex_13 Int)) (let ((.cse2 (mod v_prenex_13 299849))) (and (< v_prenex_13 0) (not (= .cse2 0)) (= 0 (mod (+ .cse2 1) 5)) (<= c_~a28~0 (+ (div (+ .cse2 301) 5) 150493))))) (exists ((v_prenex_10 Int)) (let ((.cse4 (mod v_prenex_10 299849))) (let ((.cse3 (+ .cse4 300150))) (and (<= 0 v_prenex_10) (<= c_~a28~0 (+ (div .cse3 5) 150494)) (< .cse3 0) (not (= (mod .cse4 5) 0)))))) (exists ((v_prenex_8 Int)) (let ((.cse5 (+ (mod v_prenex_8 299849) 300150))) (and (<= 0 v_prenex_8) (<= 0 .cse5) (<= c_~a28~0 (+ (div .cse5 5) 150493))))) (exists ((v_prenex_12 Int)) (let ((.cse6 (mod v_prenex_12 299849))) (and (= (mod .cse6 5) 0) (<= c_~a28~0 (+ (div (+ .cse6 300150) 5) 150493)) (= .cse6 0)))) (exists ((v_prenex_7 Int)) (let ((.cse7 (mod v_prenex_7 299849))) (and (<= 0 v_prenex_7) (= (mod .cse7 5) 0) (<= c_~a28~0 (+ (div (+ .cse7 300150) 5) 150493))))) (exists ((v_~a28~0_1315 Int)) (let ((.cse8 (mod v_~a28~0_1315 299849))) (let ((.cse9 (+ .cse8 301))) (and (not (= .cse8 0)) (< v_~a28~0_1315 0) (<= 0 .cse9) (<= c_~a28~0 (+ (div .cse9 5) 150493)))))) (exists ((v_prenex_11 Int)) (let ((.cse10 (mod v_prenex_11 299849))) (let ((.cse11 (+ .cse10 301))) (and (not (= .cse10 0)) (<= c_~a28~0 (+ (div .cse11 5) 150494)) (not (= 0 (mod (+ .cse10 1) 5))) (< v_prenex_11 0) (< .cse11 0))))) (exists ((v_prenex_14 Int)) (let ((.cse13 (mod v_prenex_14 299849))) (let ((.cse12 (+ .cse13 300150))) (and (<= c_~a28~0 (+ (div .cse12 5) 150494)) (= .cse13 0) (< .cse12 0) (not (= (mod .cse13 5) 0))))))) is different from true [2019-09-07 22:13:48,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:13:48,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:13:48,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:13:48,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:13:48,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:14:06,898 WARN L188 SmtUtils]: Spent 18.35 s on a formula simplification. DAG size of input: 213 DAG size of output: 88 [2019-09-07 22:14:06,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-09-07 22:14:06,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 22:14:06,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 22:14:06,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 22:14:06,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 22:14:06,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 22:14:06,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 22:14:06,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 22:14:07,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 22:14:07,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 22:14:39,750 WARN L188 SmtUtils]: Spent 23.30 s on a formula simplification. DAG size of input: 306 DAG size of output: 29 [2019-09-07 22:14:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 522 proven. 5 refuted. 0 times theorem prover too weak. 543 trivial. 6 not checked. [2019-09-07 22:14:40,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:14:40,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-09-07 22:14:40,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 22:14:40,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 22:14:40,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=128, Unknown=6, NotChecked=46, Total=210 [2019-09-07 22:14:40,230 INFO L87 Difference]: Start difference. First operand 396548 states and 442965 transitions. Second operand 15 states. [2019-09-07 22:15:47,157 WARN L188 SmtUtils]: Spent 8.64 s on a formula simplification. DAG size of input: 82 DAG size of output: 38 [2019-09-07 22:16:01,694 WARN L188 SmtUtils]: Spent 8.90 s on a formula simplification. DAG size of input: 137 DAG size of output: 33 [2019-09-07 22:16:30,138 WARN L188 SmtUtils]: Spent 19.01 s on a formula simplification that was a NOOP. DAG size: 118 [2019-09-07 22:16:31,111 WARN L188 SmtUtils]: Spent 817.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-09-07 22:16:34,841 WARN L188 SmtUtils]: Spent 1000.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-09-07 22:17:07,524 WARN L188 SmtUtils]: Spent 15.36 s on a formula simplification that was a NOOP. DAG size: 120 [2019-09-07 22:17:32,914 WARN L188 SmtUtils]: Spent 16.39 s on a formula simplification that was a NOOP. DAG size: 117 [2019-09-07 22:17:44,635 WARN L188 SmtUtils]: Spent 6.73 s on a formula simplification. DAG size of input: 71 DAG size of output: 27 [2019-09-07 22:18:00,026 WARN L188 SmtUtils]: Spent 12.28 s on a formula simplification. DAG size of input: 120 DAG size of output: 71