java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label46.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 18:28:37,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 18:28:37,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 18:28:37,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 18:28:37,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 18:28:37,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 18:28:37,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 18:28:37,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 18:28:37,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 18:28:37,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 18:28:37,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 18:28:37,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 18:28:37,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 18:28:37,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 18:28:37,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 18:28:37,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 18:28:37,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 18:28:37,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 18:28:37,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 18:28:37,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 18:28:37,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 18:28:37,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 18:28:37,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 18:28:37,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 18:28:37,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 18:28:37,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 18:28:37,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 18:28:37,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 18:28:37,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 18:28:37,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 18:28:37,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 18:28:37,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 18:28:37,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 18:28:37,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 18:28:37,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 18:28:37,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 18:28:37,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 18:28:37,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 18:28:37,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 18:28:37,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 18:28:37,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 18:28:37,942 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 18:28:37,956 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 18:28:37,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 18:28:37,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 18:28:37,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 18:28:37,958 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 18:28:37,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 18:28:37,959 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 18:28:37,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 18:28:37,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 18:28:37,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 18:28:37,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 18:28:37,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 18:28:37,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 18:28:37,960 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 18:28:37,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 18:28:37,961 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 18:28:37,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 18:28:37,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 18:28:37,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 18:28:37,961 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 18:28:37,962 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 18:28:37,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 18:28:37,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 18:28:37,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 18:28:37,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 18:28:37,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 18:28:37,963 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 18:28:37,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 18:28:37,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 18:28:37,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 18:28:38,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 18:28:38,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 18:28:38,010 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 18:28:38,010 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 18:28:38,011 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label46.c [2019-09-07 18:28:38,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c9ed9f0/a22bc126c9d14fcdbf53954742210192/FLAGb8e854ed0 [2019-09-07 18:28:38,722 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 18:28:38,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label46.c [2019-09-07 18:28:38,740 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c9ed9f0/a22bc126c9d14fcdbf53954742210192/FLAGb8e854ed0 [2019-09-07 18:28:39,000 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c9ed9f0/a22bc126c9d14fcdbf53954742210192 [2019-09-07 18:28:39,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 18:28:39,013 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 18:28:39,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 18:28:39,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 18:28:39,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 18:28:39,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:28:39" (1/1) ... [2019-09-07 18:28:39,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45cd0495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:28:39, skipping insertion in model container [2019-09-07 18:28:39,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:28:39" (1/1) ... [2019-09-07 18:28:39,030 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 18:28:39,107 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 18:28:40,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:28:40,012 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 18:28:40,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:28:40,242 INFO L192 MainTranslator]: Completed translation [2019-09-07 18:28:40,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:28:40 WrapperNode [2019-09-07 18:28:40,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 18:28:40,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 18:28:40,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 18:28:40,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 18:28:40,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:28:40" (1/1) ... [2019-09-07 18:28:40,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:28:40" (1/1) ... [2019-09-07 18:28:40,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:28:40" (1/1) ... [2019-09-07 18:28:40,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:28:40" (1/1) ... [2019-09-07 18:28:40,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:28:40" (1/1) ... [2019-09-07 18:28:40,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:28:40" (1/1) ... [2019-09-07 18:28:40,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:28:40" (1/1) ... [2019-09-07 18:28:40,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 18:28:40,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 18:28:40,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 18:28:40,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 18:28:40,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:28: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 18:28:40,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 18:28:40,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 18:28:40,516 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 18:28:40,516 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 18:28:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 18:28:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 18:28:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 18:28:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 18:28:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 18:28:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 18:28:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 18:28:42,428 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 18:28:42,428 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 18:28:42,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:28:42 BoogieIcfgContainer [2019-09-07 18:28:42,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 18:28:42,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 18:28:42,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 18:28:42,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 18:28:42,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 06:28:39" (1/3) ... [2019-09-07 18:28:42,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4607e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:28:42, skipping insertion in model container [2019-09-07 18:28:42,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:28:40" (2/3) ... [2019-09-07 18:28:42,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4607e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:28:42, skipping insertion in model container [2019-09-07 18:28:42,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:28:42" (3/3) ... [2019-09-07 18:28:42,452 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label46.c [2019-09-07 18:28:42,462 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 18:28:42,469 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 18:28:42,486 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 18:28:42,522 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 18:28:42,522 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 18:28:42,523 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 18:28:42,523 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 18:28:42,523 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 18:28:42,523 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 18:28:42,523 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 18:28:42,524 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 18:28:42,524 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 18:28:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-09-07 18:28:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 18:28:42,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:28:42,581 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:28:42,583 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:28:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:28:42,588 INFO L82 PathProgramCache]: Analyzing trace with hash -611621221, now seen corresponding path program 1 times [2019-09-07 18:28:42,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:28:42,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:28:42,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:28:42,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:28:42,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:28:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:28:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:28:43,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:28:43,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 18:28:43,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 18:28:43,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 18:28:43,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:28:43,027 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 3 states. [2019-09-07 18:28:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:28:44,602 INFO L93 Difference]: Finished difference Result 779 states and 1369 transitions. [2019-09-07 18:28:44,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 18:28:44,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-07 18:28:44,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:28:44,630 INFO L225 Difference]: With dead ends: 779 [2019-09-07 18:28:44,631 INFO L226 Difference]: Without dead ends: 425 [2019-09-07 18:28:44,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:28:44,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-09-07 18:28:44,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 420. [2019-09-07 18:28:44,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-09-07 18:28:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 672 transitions. [2019-09-07 18:28:44,740 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 672 transitions. Word has length 68 [2019-09-07 18:28:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:28:44,740 INFO L475 AbstractCegarLoop]: Abstraction has 420 states and 672 transitions. [2019-09-07 18:28:44,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 18:28:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 672 transitions. [2019-09-07 18:28:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-07 18:28:44,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:28:44,749 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 18:28:44,749 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:28:44,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:28:44,750 INFO L82 PathProgramCache]: Analyzing trace with hash 742132470, now seen corresponding path program 1 times [2019-09-07 18:28:44,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:28:44,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:28:44,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:28:44,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:28:44,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:28:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:28:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:28:44,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:28:44,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 18:28:44,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 18:28:44,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 18:28:44,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:28:44,932 INFO L87 Difference]: Start difference. First operand 420 states and 672 transitions. Second operand 3 states. [2019-09-07 18:28:46,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:28:46,116 INFO L93 Difference]: Finished difference Result 1218 states and 1971 transitions. [2019-09-07 18:28:46,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 18:28:46,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-07 18:28:46,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:28:46,123 INFO L225 Difference]: With dead ends: 1218 [2019-09-07 18:28:46,123 INFO L226 Difference]: Without dead ends: 804 [2019-09-07 18:28:46,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:28:46,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-09-07 18:28:46,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2019-09-07 18:28:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-09-07 18:28:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1216 transitions. [2019-09-07 18:28:46,164 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1216 transitions. Word has length 142 [2019-09-07 18:28:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:28:46,167 INFO L475 AbstractCegarLoop]: Abstraction has 804 states and 1216 transitions. [2019-09-07 18:28:46,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 18:28:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1216 transitions. [2019-09-07 18:28:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-07 18:28:46,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:28:46,176 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:28:46,177 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:28:46,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:28:46,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2062680534, now seen corresponding path program 1 times [2019-09-07 18:28:46,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:28:46,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:28:46,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:28:46,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:28:46,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:28:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:28:46,384 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:28:46,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:28:46,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:28:46,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:28:46,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:28:46,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:28:46,390 INFO L87 Difference]: Start difference. First operand 804 states and 1216 transitions. Second operand 6 states. [2019-09-07 18:28:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:28:48,978 INFO L93 Difference]: Finished difference Result 2463 states and 4087 transitions. [2019-09-07 18:28:48,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 18:28:48,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-09-07 18:28:48,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:28:49,002 INFO L225 Difference]: With dead ends: 2463 [2019-09-07 18:28:49,002 INFO L226 Difference]: Without dead ends: 1665 [2019-09-07 18:28:49,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-07 18:28:49,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2019-09-07 18:28:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1425. [2019-09-07 18:28:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1425 states. [2019-09-07 18:28:49,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2145 transitions. [2019-09-07 18:28:49,122 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 2145 transitions. Word has length 158 [2019-09-07 18:28:49,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:28:49,125 INFO L475 AbstractCegarLoop]: Abstraction has 1425 states and 2145 transitions. [2019-09-07 18:28:49,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:28:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 2145 transitions. [2019-09-07 18:28:49,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-07 18:28:49,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:28:49,152 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:28:49,152 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:28:49,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:28:49,153 INFO L82 PathProgramCache]: Analyzing trace with hash -917516290, now seen corresponding path program 1 times [2019-09-07 18:28:49,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:28:49,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:28:49,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:28:49,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:28:49,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:28:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:28:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:28:49,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:28:49,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:28:49,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:28:49,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:28:49,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:28:49,461 INFO L87 Difference]: Start difference. First operand 1425 states and 2145 transitions. Second operand 6 states. [2019-09-07 18:28:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:28:51,255 INFO L93 Difference]: Finished difference Result 4087 states and 6397 transitions. [2019-09-07 18:28:51,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 18:28:51,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-09-07 18:28:51,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:28:51,275 INFO L225 Difference]: With dead ends: 4087 [2019-09-07 18:28:51,275 INFO L226 Difference]: Without dead ends: 2668 [2019-09-07 18:28:51,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:28:51,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2019-09-07 18:28:51,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2633. [2019-09-07 18:28:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2633 states. [2019-09-07 18:28:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3779 transitions. [2019-09-07 18:28:51,397 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3779 transitions. Word has length 211 [2019-09-07 18:28:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:28:51,397 INFO L475 AbstractCegarLoop]: Abstraction has 2633 states and 3779 transitions. [2019-09-07 18:28:51,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:28:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3779 transitions. [2019-09-07 18:28:51,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-07 18:28:51,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:28:51,406 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:28:51,406 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:28:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:28:51,407 INFO L82 PathProgramCache]: Analyzing trace with hash -244168043, now seen corresponding path program 1 times [2019-09-07 18:28:51,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:28:51,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:28:51,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:28:51,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:28:51,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:28:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:28:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 122 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 18:28:51,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:28:51,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:28:51,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:28:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:28:51,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 18:28:51,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:28:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-07 18:28:51,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:28:51,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 18:28:51,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:28:51,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:28:51,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:28:51,990 INFO L87 Difference]: Start difference. First operand 2633 states and 3779 transitions. Second operand 9 states. [2019-09-07 18:28:54,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:28:54,650 INFO L93 Difference]: Finished difference Result 7950 states and 12902 transitions. [2019-09-07 18:28:54,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 18:28:54,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 230 [2019-09-07 18:28:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:28:54,709 INFO L225 Difference]: With dead ends: 7950 [2019-09-07 18:28:54,709 INFO L226 Difference]: Without dead ends: 5323 [2019-09-07 18:28:54,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:28:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states. [2019-09-07 18:28:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 5232. [2019-09-07 18:28:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5232 states. [2019-09-07 18:28:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5232 states to 5232 states and 7856 transitions. [2019-09-07 18:28:55,024 INFO L78 Accepts]: Start accepts. Automaton has 5232 states and 7856 transitions. Word has length 230 [2019-09-07 18:28:55,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:28:55,024 INFO L475 AbstractCegarLoop]: Abstraction has 5232 states and 7856 transitions. [2019-09-07 18:28:55,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:28:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 5232 states and 7856 transitions. [2019-09-07 18:28:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-07 18:28:55,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:28:55,036 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:28:55,036 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:28:55,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:28:55,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1572726936, now seen corresponding path program 1 times [2019-09-07 18:28:55,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:28:55,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:28:55,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:28:55,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:28:55,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:28:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:28:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 193 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:28:55,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:28:55,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:28:55,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:28:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:28:55,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:28:55,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:28:55,507 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 193 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:28:55,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:28:55,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-09-07 18:28:55,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:28:55,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:28:55,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:28:55,513 INFO L87 Difference]: Start difference. First operand 5232 states and 7856 transitions. Second operand 6 states. [2019-09-07 18:28:56,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:28:56,944 INFO L93 Difference]: Finished difference Result 10538 states and 16973 transitions. [2019-09-07 18:28:56,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:28:56,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 231 [2019-09-07 18:28:56,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:28:56,977 INFO L225 Difference]: With dead ends: 10538 [2019-09-07 18:28:56,978 INFO L226 Difference]: Without dead ends: 5500 [2019-09-07 18:28:57,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:28:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5500 states. [2019-09-07 18:28:57,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5500 to 4584. [2019-09-07 18:28:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4584 states. [2019-09-07 18:28:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 5875 transitions. [2019-09-07 18:28:57,187 INFO L78 Accepts]: Start accepts. Automaton has 4584 states and 5875 transitions. Word has length 231 [2019-09-07 18:28:57,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:28:57,189 INFO L475 AbstractCegarLoop]: Abstraction has 4584 states and 5875 transitions. [2019-09-07 18:28:57,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:28:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 4584 states and 5875 transitions. [2019-09-07 18:28:57,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-07 18:28:57,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:28:57,203 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:28:57,203 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:28:57,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:28:57,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2139129697, now seen corresponding path program 1 times [2019-09-07 18:28:57,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:28:57,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:28:57,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:28:57,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:28:57,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:28:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:28:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 7 proven. 121 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 18:28:57,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:28:57,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:28:57,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:28:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:28:57,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:28:57,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:28:57,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:28:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 210 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:28:57,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:28:57,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-09-07 18:28:57,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 18:28:57,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 18:28:57,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-07 18:28:57,880 INFO L87 Difference]: Start difference. First operand 4584 states and 5875 transitions. Second operand 12 states. [2019-09-07 18:29:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:29:07,059 INFO L93 Difference]: Finished difference Result 16155 states and 22307 transitions. [2019-09-07 18:29:07,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-07 18:29:07,061 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 289 [2019-09-07 18:29:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:29:07,133 INFO L225 Difference]: With dead ends: 16155 [2019-09-07 18:29:07,134 INFO L226 Difference]: Without dead ends: 11765 [2019-09-07 18:29:07,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2227 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1072, Invalid=5090, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 18:29:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11765 states. [2019-09-07 18:29:07,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11765 to 10641. [2019-09-07 18:29:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10641 states. [2019-09-07 18:29:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10641 states to 10641 states and 13670 transitions. [2019-09-07 18:29:07,506 INFO L78 Accepts]: Start accepts. Automaton has 10641 states and 13670 transitions. Word has length 289 [2019-09-07 18:29:07,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:29:07,507 INFO L475 AbstractCegarLoop]: Abstraction has 10641 states and 13670 transitions. [2019-09-07 18:29:07,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 18:29:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 10641 states and 13670 transitions. [2019-09-07 18:29:07,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-07 18:29:07,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:29:07,530 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:29:07,530 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:29:07,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:29:07,531 INFO L82 PathProgramCache]: Analyzing trace with hash 802570772, now seen corresponding path program 1 times [2019-09-07 18:29:07,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:29:07,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:29:07,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:29:07,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:29:07,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:29:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:29:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 122 proven. 105 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 18:29:08,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:29:08,175 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:29:08,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:29:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:29:08,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 18:29:08,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:29:08,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:29:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-07 18:29:08,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:29:08,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-09-07 18:29:08,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:29:08,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:29:08,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:29:08,476 INFO L87 Difference]: Start difference. First operand 10641 states and 13670 transitions. Second operand 9 states. [2019-09-07 18:29:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:29:10,830 INFO L93 Difference]: Finished difference Result 21313 states and 29766 transitions. [2019-09-07 18:29:10,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 18:29:10,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 320 [2019-09-07 18:29:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:29:10,895 INFO L225 Difference]: With dead ends: 21313 [2019-09-07 18:29:10,895 INFO L226 Difference]: Without dead ends: 11056 [2019-09-07 18:29:10,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2019-09-07 18:29:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11056 states. [2019-09-07 18:29:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11056 to 10663. [2019-09-07 18:29:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10663 states. [2019-09-07 18:29:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10663 states to 10663 states and 13680 transitions. [2019-09-07 18:29:11,260 INFO L78 Accepts]: Start accepts. Automaton has 10663 states and 13680 transitions. Word has length 320 [2019-09-07 18:29:11,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:29:11,261 INFO L475 AbstractCegarLoop]: Abstraction has 10663 states and 13680 transitions. [2019-09-07 18:29:11,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:29:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 10663 states and 13680 transitions. [2019-09-07 18:29:11,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-07 18:29:11,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:29:11,276 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:29:11,276 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:29:11,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:29:11,276 INFO L82 PathProgramCache]: Analyzing trace with hash -68672635, now seen corresponding path program 1 times [2019-09-07 18:29:11,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:29:11,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:29:11,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:29:11,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:29:11,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:29:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:29:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 236 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:29:12,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:29:12,348 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 18:29:12,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:29:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:29:12,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:29:12,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:29:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 236 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:29:12,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:29:12,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-09-07 18:29:12,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 18:29:12,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 18:29:12,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-09-07 18:29:12,629 INFO L87 Difference]: Start difference. First operand 10663 states and 13680 transitions. Second operand 18 states. [2019-09-07 18:29:19,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:29:19,011 INFO L93 Difference]: Finished difference Result 20859 states and 26898 transitions. [2019-09-07 18:29:19,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 18:29:19,012 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 327 [2019-09-07 18:29:19,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:29:19,044 INFO L225 Difference]: With dead ends: 20859 [2019-09-07 18:29:19,044 INFO L226 Difference]: Without dead ends: 10580 [2019-09-07 18:29:19,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=855, Invalid=2805, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 18:29:19,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10580 states. [2019-09-07 18:29:19,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10580 to 10306. [2019-09-07 18:29:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10306 states. [2019-09-07 18:29:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10306 states to 10306 states and 12993 transitions. [2019-09-07 18:29:19,341 INFO L78 Accepts]: Start accepts. Automaton has 10306 states and 12993 transitions. Word has length 327 [2019-09-07 18:29:19,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:29:19,342 INFO L475 AbstractCegarLoop]: Abstraction has 10306 states and 12993 transitions. [2019-09-07 18:29:19,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 18:29:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 10306 states and 12993 transitions. [2019-09-07 18:29:19,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-07 18:29:19,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:29:19,360 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:29:19,360 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:29:19,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:29:19,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1656214614, now seen corresponding path program 1 times [2019-09-07 18:29:19,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:29:19,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:29:19,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:29:19,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:29:19,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:29:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:29:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 129 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:29:20,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:29:20,329 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 18:29:20,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:29:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:29:20,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 18:29:20,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:29:20,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:29:20,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:29:22,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:29:25,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:29:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 263 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:29:25,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:29:25,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-09-07 18:29:25,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 18:29:25,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 18:29:25,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=216, Unknown=2, NotChecked=0, Total=272 [2019-09-07 18:29:25,293 INFO L87 Difference]: Start difference. First operand 10306 states and 12993 transitions. Second operand 17 states. [2019-09-07 18:29:28,947 WARN L188 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2019-09-07 18:29:45,063 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 39 [2019-09-07 18:30:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:30:07,313 INFO L93 Difference]: Finished difference Result 29885 states and 39687 transitions. [2019-09-07 18:30:07,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 18:30:07,314 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 358 [2019-09-07 18:30:07,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:30:07,390 INFO L225 Difference]: With dead ends: 29885 [2019-09-07 18:30:07,391 INFO L226 Difference]: Without dead ends: 19773 [2019-09-07 18:30:07,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 353 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=486, Invalid=1673, Unknown=3, NotChecked=0, Total=2162 [2019-09-07 18:30:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19773 states. [2019-09-07 18:30:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19773 to 17671. [2019-09-07 18:30:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17671 states. [2019-09-07 18:30:07,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17671 states to 17671 states and 22566 transitions. [2019-09-07 18:30:07,872 INFO L78 Accepts]: Start accepts. Automaton has 17671 states and 22566 transitions. Word has length 358 [2019-09-07 18:30:07,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:30:07,872 INFO L475 AbstractCegarLoop]: Abstraction has 17671 states and 22566 transitions. [2019-09-07 18:30:07,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 18:30:07,873 INFO L276 IsEmpty]: Start isEmpty. Operand 17671 states and 22566 transitions. [2019-09-07 18:30:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-07 18:30:07,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:30:07,903 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:30:07,903 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:30:07,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:30:07,903 INFO L82 PathProgramCache]: Analyzing trace with hash -134195911, now seen corresponding path program 1 times [2019-09-07 18:30:07,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:30:07,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:30:07,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:07,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:07,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 254 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:30:09,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:30:09,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:30:09,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:09,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 18:30:09,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:30:09,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:30:09,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:09,852 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 140 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:30:09,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:30:09,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 19 [2019-09-07 18:30:09,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 18:30:09,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 18:30:09,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-09-07 18:30:09,857 INFO L87 Difference]: Start difference. First operand 17671 states and 22566 transitions. Second operand 19 states. [2019-09-07 18:30:10,561 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-07 18:30:11,930 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-07 18:30:13,631 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-07 18:30:15,662 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-07 18:30:18,128 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-07 18:30:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:30:19,820 INFO L93 Difference]: Finished difference Result 44628 states and 58105 transitions. [2019-09-07 18:30:19,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 18:30:19,820 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 396 [2019-09-07 18:30:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:30:19,888 INFO L225 Difference]: With dead ends: 44628 [2019-09-07 18:30:19,888 INFO L226 Difference]: Without dead ends: 26357 [2019-09-07 18:30:19,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=967, Invalid=2339, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 18:30:19,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26357 states. [2019-09-07 18:30:20,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26357 to 23197. [2019-09-07 18:30:20,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23197 states. [2019-09-07 18:30:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23197 states to 23197 states and 28263 transitions. [2019-09-07 18:30:20,307 INFO L78 Accepts]: Start accepts. Automaton has 23197 states and 28263 transitions. Word has length 396 [2019-09-07 18:30:20,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:30:20,308 INFO L475 AbstractCegarLoop]: Abstraction has 23197 states and 28263 transitions. [2019-09-07 18:30:20,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 18:30:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 23197 states and 28263 transitions. [2019-09-07 18:30:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2019-09-07 18:30:20,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:30:20,366 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:30:20,366 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:30:20,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:30:20,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1466840199, now seen corresponding path program 1 times [2019-09-07 18:30:20,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:30:20,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:30:20,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:20,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:20,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 640 proven. 100 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 18:30:20,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:30:20,992 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) [2019-09-07 18:30:21,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:30:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:21,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 18:30:21,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:30:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 256 proven. 10 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:30:21,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:30:21,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-09-07 18:30:21,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 18:30:21,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 18:30:21,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-07 18:30:21,419 INFO L87 Difference]: Start difference. First operand 23197 states and 28263 transitions. Second operand 10 states. [2019-09-07 18:30:25,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:30:25,398 INFO L93 Difference]: Finished difference Result 56586 states and 69625 transitions. [2019-09-07 18:30:25,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 18:30:25,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 521 [2019-09-07 18:30:25,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:30:25,473 INFO L225 Difference]: With dead ends: 56586 [2019-09-07 18:30:25,473 INFO L226 Difference]: Without dead ends: 33191 [2019-09-07 18:30:25,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2019-09-07 18:30:25,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33191 states. [2019-09-07 18:30:27,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33191 to 31305. [2019-09-07 18:30:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31305 states. [2019-09-07 18:30:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31305 states to 31305 states and 37538 transitions. [2019-09-07 18:30:27,088 INFO L78 Accepts]: Start accepts. Automaton has 31305 states and 37538 transitions. Word has length 521 [2019-09-07 18:30:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:30:27,089 INFO L475 AbstractCegarLoop]: Abstraction has 31305 states and 37538 transitions. [2019-09-07 18:30:27,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 18:30:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 31305 states and 37538 transitions. [2019-09-07 18:30:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2019-09-07 18:30:27,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:30:27,145 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:30:27,145 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:30:27,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:30:27,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1612244236, now seen corresponding path program 1 times [2019-09-07 18:30:27,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:30:27,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:30:27,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:27,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:27,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 489 proven. 90 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-09-07 18:30:28,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:30:28,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:30:28,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:28,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:30:28,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:30:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 518 proven. 2 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-09-07 18:30:29,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:30:29,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 18:30:29,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 18:30:29,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 18:30:29,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:30:29,290 INFO L87 Difference]: Start difference. First operand 31305 states and 37538 transitions. Second operand 15 states. [2019-09-07 18:30:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:30:36,932 INFO L93 Difference]: Finished difference Result 64755 states and 79625 transitions. [2019-09-07 18:30:36,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 18:30:36,933 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 565 [2019-09-07 18:30:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:30:36,996 INFO L225 Difference]: With dead ends: 64755 [2019-09-07 18:30:36,997 INFO L226 Difference]: Without dead ends: 33834 [2019-09-07 18:30:37,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=736, Invalid=2924, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 18:30:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33834 states. [2019-09-07 18:30:37,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33834 to 33364. [2019-09-07 18:30:37,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33364 states. [2019-09-07 18:30:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33364 states to 33364 states and 39375 transitions. [2019-09-07 18:30:37,680 INFO L78 Accepts]: Start accepts. Automaton has 33364 states and 39375 transitions. Word has length 565 [2019-09-07 18:30:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:30:37,681 INFO L475 AbstractCegarLoop]: Abstraction has 33364 states and 39375 transitions. [2019-09-07 18:30:37,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 18:30:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 33364 states and 39375 transitions. [2019-09-07 18:30:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2019-09-07 18:30:37,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:30:37,715 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:30:37,716 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:30:37,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:30:37,716 INFO L82 PathProgramCache]: Analyzing trace with hash 472829611, now seen corresponding path program 1 times [2019-09-07 18:30:37,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:30:37,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:30:37,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:37,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:37,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 373 proven. 244 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2019-09-07 18:30:38,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:30:38,343 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 18:30:38,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:38,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:30:38,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:30:38,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:38,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:41,671 WARN L188 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-09-07 18:30:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 625 proven. 122 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-09-07 18:30:41,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:30:41,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 9 [2019-09-07 18:30:41,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:30:41,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:30:41,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=53, Unknown=1, NotChecked=0, Total=72 [2019-09-07 18:30:41,851 INFO L87 Difference]: Start difference. First operand 33364 states and 39375 transitions. Second operand 9 states. [2019-09-07 18:30:42,320 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-09-07 18:30:45,245 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-09-07 18:31:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:31:36,374 INFO L93 Difference]: Finished difference Result 78867 states and 96710 transitions. [2019-09-07 18:31:36,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 18:31:36,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 596 [2019-09-07 18:31:36,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:31:36,467 INFO L225 Difference]: With dead ends: 78867 [2019-09-07 18:31:36,468 INFO L226 Difference]: Without dead ends: 45887 [2019-09-07 18:31:36,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 605 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=133, Invalid=370, Unknown=3, NotChecked=0, Total=506 [2019-09-07 18:31:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45887 states. [2019-09-07 18:31:37,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45887 to 45028. [2019-09-07 18:31:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45028 states. [2019-09-07 18:31:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45028 states to 45028 states and 52626 transitions. [2019-09-07 18:31:37,610 INFO L78 Accepts]: Start accepts. Automaton has 45028 states and 52626 transitions. Word has length 596 [2019-09-07 18:31:37,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:31:37,611 INFO L475 AbstractCegarLoop]: Abstraction has 45028 states and 52626 transitions. [2019-09-07 18:31:37,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:31:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 45028 states and 52626 transitions. [2019-09-07 18:31:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2019-09-07 18:31:37,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:31:37,684 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2019-09-07 18:31:37,685 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:31:37,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:31:37,685 INFO L82 PathProgramCache]: Analyzing trace with hash -857845892, now seen corresponding path program 1 times [2019-09-07 18:31:37,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:31:37,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:31:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:31:37,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:31:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:31:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:31:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 494 proven. 170 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2019-09-07 18:31:39,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:31:39,064 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:31:39,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:31:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:31:39,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 18:31:39,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:31:39,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:31:39,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:31:43,278 WARN L188 SmtUtils]: Spent 3.80 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-07 18:31:43,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:31:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 699 proven. 398 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2019-09-07 18:31:43,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:31:43,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2019-09-07 18:31:43,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 18:31:43,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 18:31:43,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-07 18:31:43,837 INFO L87 Difference]: Start difference. First operand 45028 states and 52626 transitions. Second operand 13 states. [2019-09-07 18:31:48,081 WARN L188 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-07 18:31:57,233 WARN L188 SmtUtils]: Spent 5.84 s on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-07 18:32:01,094 WARN L188 SmtUtils]: Spent 3.78 s on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-07 18:32:20,944 WARN L188 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-07 18:32:48,529 WARN L188 SmtUtils]: Spent 3.27 s on a formula simplification that was a NOOP. DAG size: 36 [2019-09-07 18:32:50,916 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2019-09-07 18:33:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:33:59,917 INFO L93 Difference]: Finished difference Result 118224 states and 142098 transitions. [2019-09-07 18:33:59,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-07 18:33:59,918 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 654 [2019-09-07 18:33:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:34:00,067 INFO L225 Difference]: With dead ends: 118224 [2019-09-07 18:34:00,067 INFO L226 Difference]: Without dead ends: 72232 [2019-09-07 18:34:00,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 706 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2300 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=989, Invalid=5331, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 18:34:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72232 states. [2019-09-07 18:34:02,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72232 to 67282. [2019-09-07 18:34:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67282 states. [2019-09-07 18:34:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67282 states to 67282 states and 78291 transitions. [2019-09-07 18:34:02,972 INFO L78 Accepts]: Start accepts. Automaton has 67282 states and 78291 transitions. Word has length 654 [2019-09-07 18:34:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:34:02,973 INFO L475 AbstractCegarLoop]: Abstraction has 67282 states and 78291 transitions. [2019-09-07 18:34:02,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 18:34:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 67282 states and 78291 transitions. [2019-09-07 18:34:03,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2019-09-07 18:34:03,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:34:03,067 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:34:03,067 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:34:03,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:34:03,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1159907426, now seen corresponding path program 1 times [2019-09-07 18:34:03,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:34:03,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:34:03,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:03,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:03,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 568 proven. 244 refuted. 0 times theorem prover too weak. 779 trivial. 0 not checked. [2019-09-07 18:34:04,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:34:04,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:34:04,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:04,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 18:34:04,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:34:04,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:34:05,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:34:05,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:34:05,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:34:05,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:34:05,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:34:05,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:34:05,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:34:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 1204 proven. 2 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-09-07 18:34:05,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:34:05,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2019-09-07 18:34:05,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 18:34:05,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 18:34:05,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:34:05,823 INFO L87 Difference]: Start difference. First operand 67282 states and 78291 transitions. Second operand 16 states. [2019-09-07 18:34:06,609 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-07 18:34:07,234 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-07 18:34:07,894 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-07 18:34:08,538 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-07 18:34:11,995 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-07 18:34:12,466 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-07 18:34:12,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:34:12,703 INFO L93 Difference]: Finished difference Result 124280 states and 145193 transitions. [2019-09-07 18:34:12,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 18:34:12,703 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 734 [2019-09-07 18:34:12,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:34:12,821 INFO L225 Difference]: With dead ends: 124280 [2019-09-07 18:34:12,821 INFO L226 Difference]: Without dead ends: 66170 [2019-09-07 18:34:12,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 752 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=461, Invalid=1431, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 18:34:12,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66170 states. [2019-09-07 18:34:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66170 to 65228. [2019-09-07 18:34:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65228 states. [2019-09-07 18:34:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65228 states to 65228 states and 75626 transitions. [2019-09-07 18:34:13,784 INFO L78 Accepts]: Start accepts. Automaton has 65228 states and 75626 transitions. Word has length 734 [2019-09-07 18:34:13,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:34:13,784 INFO L475 AbstractCegarLoop]: Abstraction has 65228 states and 75626 transitions. [2019-09-07 18:34:13,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 18:34:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 65228 states and 75626 transitions. [2019-09-07 18:34:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2019-09-07 18:34:13,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:34:13,853 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:34:13,853 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:34:13,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:34:13,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1320502992, now seen corresponding path program 1 times [2019-09-07 18:34:13,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:34:13,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:34:13,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:13,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:13,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1854 backedges. 636 proven. 170 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2019-09-07 18:34:15,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:34:15,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:34:15,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:15,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 18:34:15,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:34:15,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:34:15,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 18:34:15,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:34:15,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 18:34:15,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 18:34:16,841 WARN L188 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-07 18:34:16,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:34:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1854 backedges. 1220 proven. 141 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2019-09-07 18:34:17,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:34:17,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 14 [2019-09-07 18:34:17,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 18:34:17,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 18:34:17,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-07 18:34:17,844 INFO L87 Difference]: Start difference. First operand 65228 states and 75626 transitions. Second operand 14 states. [2019-09-07 18:34:26,359 WARN L188 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 31 [2019-09-07 18:34:28,246 WARN L188 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-07 18:34:30,298 WARN L188 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-09-07 18:34:33,410 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-07 18:34:36,513 WARN L188 SmtUtils]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-07 18:34:37,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:34:37,877 INFO L93 Difference]: Finished difference Result 141541 states and 171855 transitions. [2019-09-07 18:34:37,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-07 18:34:37,878 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 767 [2019-09-07 18:34:37,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:34:38,075 INFO L225 Difference]: With dead ends: 141541 [2019-09-07 18:34:38,075 INFO L226 Difference]: Without dead ends: 75129 [2019-09-07 18:34:38,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 909 GetRequests, 815 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3165 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1325, Invalid=7605, Unknown=0, NotChecked=0, Total=8930 [2019-09-07 18:34:38,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75129 states. [2019-09-07 18:34:41,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75129 to 67842. [2019-09-07 18:34:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67842 states. [2019-09-07 18:34:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67842 states to 67842 states and 78143 transitions. [2019-09-07 18:34:41,346 INFO L78 Accepts]: Start accepts. Automaton has 67842 states and 78143 transitions. Word has length 767 [2019-09-07 18:34:41,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:34:41,347 INFO L475 AbstractCegarLoop]: Abstraction has 67842 states and 78143 transitions. [2019-09-07 18:34:41,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 18:34:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 67842 states and 78143 transitions. [2019-09-07 18:34:41,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2019-09-07 18:34:41,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:34:41,402 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:34:41,402 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:34:41,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:34:41,403 INFO L82 PathProgramCache]: Analyzing trace with hash -616515529, now seen corresponding path program 1 times [2019-09-07 18:34:41,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:34:41,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:34:41,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:41,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:41,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 689 proven. 283 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2019-09-07 18:34:42,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:34:42,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:34:42,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:42,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:34:42,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:34:43,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:34:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 1420 proven. 2 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2019-09-07 18:34:43,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:34:43,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2019-09-07 18:34:43,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 18:34:43,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 18:34:43,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-09-07 18:34:43,466 INFO L87 Difference]: Start difference. First operand 67842 states and 78143 transitions. Second operand 19 states. [2019-09-07 18:34:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:34:52,617 INFO L93 Difference]: Finished difference Result 139977 states and 162150 transitions. [2019-09-07 18:34:52,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 18:34:52,618 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 777 [2019-09-07 18:34:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:34:52,747 INFO L225 Difference]: With dead ends: 139977 [2019-09-07 18:34:52,747 INFO L226 Difference]: Without dead ends: 71339 [2019-09-07 18:34:52,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 868 GetRequests, 811 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=658, Invalid=2648, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 18:34:52,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71339 states. [2019-09-07 18:34:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71339 to 65884. [2019-09-07 18:34:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65884 states. [2019-09-07 18:34:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65884 states to 65884 states and 73446 transitions. [2019-09-07 18:34:53,684 INFO L78 Accepts]: Start accepts. Automaton has 65884 states and 73446 transitions. Word has length 777 [2019-09-07 18:34:53,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:34:53,685 INFO L475 AbstractCegarLoop]: Abstraction has 65884 states and 73446 transitions. [2019-09-07 18:34:53,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 18:34:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand 65884 states and 73446 transitions. [2019-09-07 18:34:53,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 802 [2019-09-07 18:34:53,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:34:53,736 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:34:53,736 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:34:53,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:34:53,737 INFO L82 PathProgramCache]: Analyzing trace with hash 264415001, now seen corresponding path program 1 times [2019-09-07 18:34:53,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:34:53,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:34:53,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:53,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:53,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 698 proven. 270 refuted. 0 times theorem prover too weak. 981 trivial. 0 not checked. [2019-09-07 18:34:54,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:34:54,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:34:54,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:55,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:34:55,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:34:55,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:34:55,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:34:55,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:34:55,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:34:55,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:34:55,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:34:55,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:34:55,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:34:55,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:35:05,584 WARN L188 SmtUtils]: Spent 10.17 s on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-07 18:35:05,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 18:35:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 1135 proven. 122 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2019-09-07 18:35:08,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:35:08,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-09-07 18:35:08,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 18:35:08,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 18:35:08,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=40, Unknown=1, NotChecked=0, Total=56 [2019-09-07 18:35:08,267 INFO L87 Difference]: Start difference. First operand 65884 states and 73446 transitions. Second operand 8 states.