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/Problem12_label52.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:10:39,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:10:39,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:10:39,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:10:39,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:10:39,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:10:39,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:10:39,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:10:39,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:10:39,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:10:39,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:10:39,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:10:39,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:10:39,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:10:39,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:10:39,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:10:39,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:10:39,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:10:39,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:10:39,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:10:39,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:10:39,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:10:39,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:10:39,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:10:39,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:10:39,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:10:39,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:10:39,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:10:39,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:10:39,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:10:39,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:10:39,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:10:39,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:10:39,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:10:39,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:10:39,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:10:39,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:10:39,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:10:39,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:10:39,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:10:39,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:10:39,853 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 19:10:39,867 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:10:39,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:10:39,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:10:39,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:10:39,869 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:10:39,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:10:39,869 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:10:39,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:10:39,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:10:39,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:10:39,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:10:39,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:10:39,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:10:39,871 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:10:39,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:10:39,871 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:10:39,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:10:39,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:10:39,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:10:39,872 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:10:39,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:10:39,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:10:39,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:10:39,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:10:39,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:10:39,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:10:39,873 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:10:39,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:10:39,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:10:39,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:10:39,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:10:39,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:10:39,928 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:10:39,929 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:10:39,929 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label52.c [2019-09-07 19:10:39,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/504df61ea/171e3294301d475599fbe933d99bbe9a/FLAG736fa9c33 [2019-09-07 19:10:40,697 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:10:40,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label52.c [2019-09-07 19:10:40,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/504df61ea/171e3294301d475599fbe933d99bbe9a/FLAG736fa9c33 [2019-09-07 19:10:40,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/504df61ea/171e3294301d475599fbe933d99bbe9a [2019-09-07 19:10:40,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:10:40,839 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:10:40,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:10:40,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:10:40,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:10:40,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:10:40" (1/1) ... [2019-09-07 19:10:40,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262768b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:40, skipping insertion in model container [2019-09-07 19:10:40,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:10:40" (1/1) ... [2019-09-07 19:10:40,856 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:10:41,026 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:10:42,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:10:42,416 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:10:43,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:10:43,070 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:10:43,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:43 WrapperNode [2019-09-07 19:10:43,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:10:43,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:10:43,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:10:43,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:10:43,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:43" (1/1) ... [2019-09-07 19:10:43,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:43" (1/1) ... [2019-09-07 19:10:43,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:43" (1/1) ... [2019-09-07 19:10:43,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:43" (1/1) ... [2019-09-07 19:10:43,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:43" (1/1) ... [2019-09-07 19:10:43,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:43" (1/1) ... [2019-09-07 19:10:43,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:43" (1/1) ... [2019-09-07 19:10:43,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:10:43,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:10:43,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:10:43,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:10:43,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:10:43,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:10:43,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:10:43,434 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:10:43,434 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:10:43,434 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:10:43,434 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:10:43,434 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:10:43,434 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:10:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:10:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:10:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:10:43,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:10:43,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:10:43,437 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:10:43,438 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:10:43,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:10:43,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:10:48,312 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:10:48,312 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:10:48,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:10:48 BoogieIcfgContainer [2019-09-07 19:10:48,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:10:48,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:10:48,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:10:48,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:10:48,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:10:40" (1/3) ... [2019-09-07 19:10:48,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388c0b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:10:48, skipping insertion in model container [2019-09-07 19:10:48,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:43" (2/3) ... [2019-09-07 19:10:48,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388c0b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:10:48, skipping insertion in model container [2019-09-07 19:10:48,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:10:48" (3/3) ... [2019-09-07 19:10:48,335 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem12_label52.c [2019-09-07 19:10:48,346 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:10:48,358 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:10:48,376 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:10:48,435 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:10:48,436 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:10:48,436 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:10:48,437 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:10:48,437 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:10:48,437 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:10:48,437 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:10:48,437 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:10:48,437 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:10:48,471 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states. [2019-09-07 19:10:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-07 19:10:48,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:10:48,480 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] [2019-09-07 19:10:48,482 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:10:48,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:10:48,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1360305261, now seen corresponding path program 1 times [2019-09-07 19:10:48,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:10:48,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:10:48,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:10:48,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:10:48,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:10:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:10:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:10:48,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:10:48,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:10:48,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:10:48,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:10:48,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:10:48,870 INFO L87 Difference]: Start difference. First operand 839 states. Second operand 3 states. [2019-09-07 19:10:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:10:54,023 INFO L93 Difference]: Finished difference Result 2443 states and 4697 transitions. [2019-09-07 19:10:54,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:10:54,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-07 19:10:54,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:10:54,066 INFO L225 Difference]: With dead ends: 2443 [2019-09-07 19:10:54,066 INFO L226 Difference]: Without dead ends: 1542 [2019-09-07 19:10:54,079 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 19:10:54,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-07 19:10:54,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2019-09-07 19:10:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2019-09-07 19:10:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2750 transitions. [2019-09-07 19:10:54,239 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2750 transitions. Word has length 36 [2019-09-07 19:10:54,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:10:54,240 INFO L475 AbstractCegarLoop]: Abstraction has 1542 states and 2750 transitions. [2019-09-07 19:10:54,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:10:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2750 transitions. [2019-09-07 19:10:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-07 19:10:54,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:10:54,248 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:10:54,248 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:10:54,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:10:54,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1512763623, now seen corresponding path program 1 times [2019-09-07 19:10:54,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:10:54,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:10:54,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:10:54,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:10:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:10:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:10:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:10:54,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:10:54,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:10:54,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:10:54,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:10:54,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:10:54,528 INFO L87 Difference]: Start difference. First operand 1542 states and 2750 transitions. Second operand 5 states. [2019-09-07 19:11:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:11:00,772 INFO L93 Difference]: Finished difference Result 4690 states and 8403 transitions. [2019-09-07 19:11:00,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:11:00,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-07 19:11:00,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:11:00,800 INFO L225 Difference]: With dead ends: 4690 [2019-09-07 19:11:00,800 INFO L226 Difference]: Without dead ends: 3154 [2019-09-07 19:11:00,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:11:00,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2019-09-07 19:11:00,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 3122. [2019-09-07 19:11:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2019-09-07 19:11:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 5336 transitions. [2019-09-07 19:11:00,947 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 5336 transitions. Word has length 109 [2019-09-07 19:11:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:11:00,949 INFO L475 AbstractCegarLoop]: Abstraction has 3122 states and 5336 transitions. [2019-09-07 19:11:00,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:11:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 5336 transitions. [2019-09-07 19:11:00,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-07 19:11:00,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:11:00,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:11:00,960 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:11:00,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:11:00,961 INFO L82 PathProgramCache]: Analyzing trace with hash 938927220, now seen corresponding path program 1 times [2019-09-07 19:11:00,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:11:00,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:11:00,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:00,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:00,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:11:01,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:11:01,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:11:01,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:11:01,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:11:01,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:11:01,180 INFO L87 Difference]: Start difference. First operand 3122 states and 5336 transitions. Second operand 6 states. [2019-09-07 19:11:07,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:11:07,902 INFO L93 Difference]: Finished difference Result 9491 states and 16483 transitions. [2019-09-07 19:11:07,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:11:07,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-09-07 19:11:07,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:11:07,945 INFO L225 Difference]: With dead ends: 9491 [2019-09-07 19:11:07,948 INFO L226 Difference]: Without dead ends: 6375 [2019-09-07 19:11:07,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:11:07,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6375 states. [2019-09-07 19:11:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6375 to 6333. [2019-09-07 19:11:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6333 states. [2019-09-07 19:11:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6333 states to 6333 states and 10769 transitions. [2019-09-07 19:11:08,240 INFO L78 Accepts]: Start accepts. Automaton has 6333 states and 10769 transitions. Word has length 114 [2019-09-07 19:11:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:11:08,242 INFO L475 AbstractCegarLoop]: Abstraction has 6333 states and 10769 transitions. [2019-09-07 19:11:08,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:11:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 6333 states and 10769 transitions. [2019-09-07 19:11:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-07 19:11:08,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:11:08,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:11:08,245 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:11:08,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:11:08,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1373654300, now seen corresponding path program 1 times [2019-09-07 19:11:08,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:11:08,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:11:08,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:08,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:08,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:11:08,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:11:08,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:11:08,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:11:08,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:11:08,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:11:08,407 INFO L87 Difference]: Start difference. First operand 6333 states and 10769 transitions. Second operand 6 states. [2019-09-07 19:11:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:11:14,262 INFO L93 Difference]: Finished difference Result 15980 states and 27525 transitions. [2019-09-07 19:11:14,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:11:14,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-09-07 19:11:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:11:14,320 INFO L225 Difference]: With dead ends: 15980 [2019-09-07 19:11:14,320 INFO L226 Difference]: Without dead ends: 9653 [2019-09-07 19:11:14,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:11:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9653 states. [2019-09-07 19:11:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9653 to 9576. [2019-09-07 19:11:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9576 states. [2019-09-07 19:11:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9576 states to 9576 states and 15605 transitions. [2019-09-07 19:11:14,601 INFO L78 Accepts]: Start accepts. Automaton has 9576 states and 15605 transitions. Word has length 122 [2019-09-07 19:11:14,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:11:14,602 INFO L475 AbstractCegarLoop]: Abstraction has 9576 states and 15605 transitions. [2019-09-07 19:11:14,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:11:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand 9576 states and 15605 transitions. [2019-09-07 19:11:14,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-07 19:11:14,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:11:14,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:11:14,605 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:11:14,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:11:14,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1154244611, now seen corresponding path program 1 times [2019-09-07 19:11:14,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:11:14,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:11:14,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:14,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:14,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:11:14,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:11:14,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:11:14,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:11:14,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:11:14,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:11:14,787 INFO L87 Difference]: Start difference. First operand 9576 states and 15605 transitions. Second operand 6 states. [2019-09-07 19:11:27,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:11:27,207 INFO L93 Difference]: Finished difference Result 37842 states and 68753 transitions. [2019-09-07 19:11:27,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 19:11:27,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-09-07 19:11:27,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:11:27,407 INFO L225 Difference]: With dead ends: 37842 [2019-09-07 19:11:27,407 INFO L226 Difference]: Without dead ends: 28272 [2019-09-07 19:11:27,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-07 19:11:27,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28272 states. [2019-09-07 19:11:28,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28272 to 28091. [2019-09-07 19:11:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28091 states. [2019-09-07 19:11:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28091 states to 28091 states and 45125 transitions. [2019-09-07 19:11:29,573 INFO L78 Accepts]: Start accepts. Automaton has 28091 states and 45125 transitions. Word has length 139 [2019-09-07 19:11:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:11:29,573 INFO L475 AbstractCegarLoop]: Abstraction has 28091 states and 45125 transitions. [2019-09-07 19:11:29,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:11:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 28091 states and 45125 transitions. [2019-09-07 19:11:29,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-07 19:11:29,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:11:29,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:11:29,582 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:11:29,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:11:29,582 INFO L82 PathProgramCache]: Analyzing trace with hash -201659528, now seen corresponding path program 1 times [2019-09-07 19:11:29,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:11:29,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:11:29,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:29,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:29,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:11:29,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:11:29,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:11:29,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:11:29,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:11:29,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:11:29,769 INFO L87 Difference]: Start difference. First operand 28091 states and 45125 transitions. Second operand 6 states. [2019-09-07 19:11:36,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:11:36,135 INFO L93 Difference]: Finished difference Result 69315 states and 116434 transitions. [2019-09-07 19:11:36,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:11:36,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2019-09-07 19:11:36,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:11:36,314 INFO L225 Difference]: With dead ends: 69315 [2019-09-07 19:11:36,315 INFO L226 Difference]: Without dead ends: 41230 [2019-09-07 19:11:36,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:11:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41230 states. [2019-09-07 19:11:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41230 to 41135. [2019-09-07 19:11:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41135 states. [2019-09-07 19:11:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41135 states to 41135 states and 62347 transitions. [2019-09-07 19:11:37,614 INFO L78 Accepts]: Start accepts. Automaton has 41135 states and 62347 transitions. Word has length 160 [2019-09-07 19:11:37,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:11:37,616 INFO L475 AbstractCegarLoop]: Abstraction has 41135 states and 62347 transitions. [2019-09-07 19:11:37,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:11:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 41135 states and 62347 transitions. [2019-09-07 19:11:37,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-07 19:11:37,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:11:37,622 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:11:37,623 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:11:37,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:11:37,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1913433160, now seen corresponding path program 1 times [2019-09-07 19:11:37,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:11:37,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:11:37,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:37,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:37,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 58 proven. 81 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:11:37,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:11:37,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:11:37,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:37,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:11:37,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:11:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 19:11:38,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:11:38,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2019-09-07 19:11:38,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 19:11:38,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 19:11:38,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:11:38,004 INFO L87 Difference]: Start difference. First operand 41135 states and 62347 transitions. Second operand 7 states. [2019-09-07 19:11:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:11:47,328 INFO L93 Difference]: Finished difference Result 115306 states and 186989 transitions. [2019-09-07 19:11:47,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:11:47,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 207 [2019-09-07 19:11:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:11:47,804 INFO L225 Difference]: With dead ends: 115306 [2019-09-07 19:11:47,805 INFO L226 Difference]: Without dead ends: 74177 [2019-09-07 19:11:47,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:11:48,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74177 states. [2019-09-07 19:11:49,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74177 to 69195. [2019-09-07 19:11:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69195 states. [2019-09-07 19:11:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69195 states to 69195 states and 104323 transitions. [2019-09-07 19:11:50,302 INFO L78 Accepts]: Start accepts. Automaton has 69195 states and 104323 transitions. Word has length 207 [2019-09-07 19:11:50,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:11:50,303 INFO L475 AbstractCegarLoop]: Abstraction has 69195 states and 104323 transitions. [2019-09-07 19:11:50,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 19:11:50,303 INFO L276 IsEmpty]: Start isEmpty. Operand 69195 states and 104323 transitions. [2019-09-07 19:11:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-07 19:11:50,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:11:50,307 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:11:50,308 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:11:50,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:11:50,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1538869504, now seen corresponding path program 1 times [2019-09-07 19:11:50,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:11:50,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:11:50,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:50,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:50,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:11:50,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:11:50,496 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:11:50,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:11:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:50,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:11:50,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:11:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:11:50,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:11:50,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:11:50,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:11:50,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:11:50,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:11:50,727 INFO L87 Difference]: Start difference. First operand 69195 states and 104323 transitions. Second operand 9 states. [2019-09-07 19:12:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:12:05,961 INFO L93 Difference]: Finished difference Result 174981 states and 315268 transitions. [2019-09-07 19:12:05,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 19:12:05,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 235 [2019-09-07 19:12:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:12:09,028 INFO L225 Difference]: With dead ends: 174981 [2019-09-07 19:12:09,030 INFO L226 Difference]: Without dead ends: 97434 [2019-09-07 19:12:09,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-09-07 19:12:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97434 states. [2019-09-07 19:12:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97434 to 93392. [2019-09-07 19:12:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93392 states. [2019-09-07 19:12:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93392 states to 93392 states and 144397 transitions. [2019-09-07 19:12:12,504 INFO L78 Accepts]: Start accepts. Automaton has 93392 states and 144397 transitions. Word has length 235 [2019-09-07 19:12:12,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:12:12,505 INFO L475 AbstractCegarLoop]: Abstraction has 93392 states and 144397 transitions. [2019-09-07 19:12:12,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:12:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 93392 states and 144397 transitions. [2019-09-07 19:12:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-07 19:12:12,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:12:12,520 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:12:12,521 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:12:12,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:12:12,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1130305033, now seen corresponding path program 1 times [2019-09-07 19:12:12,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:12:12,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:12:12,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:12:12,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:12:12,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:12:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:12:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 171 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:12:12,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:12:12,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:12:12,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:12:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:12:12,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:12:12,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:12:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 171 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 19:12:13,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:12:13,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:12:13,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:12:13,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:12:13,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:12:13,029 INFO L87 Difference]: Start difference. First operand 93392 states and 144397 transitions. Second operand 9 states. [2019-09-07 19:12:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:12:31,442 INFO L93 Difference]: Finished difference Result 228160 states and 424345 transitions. [2019-09-07 19:12:31,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 19:12:31,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 296 [2019-09-07 19:12:31,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:12:32,366 INFO L225 Difference]: With dead ends: 228160 [2019-09-07 19:12:32,366 INFO L226 Difference]: Without dead ends: 134778 [2019-09-07 19:12:32,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-09-07 19:12:32,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134778 states. [2019-09-07 19:12:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134778 to 133833. [2019-09-07 19:12:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133833 states. [2019-09-07 19:12:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133833 states to 133833 states and 236979 transitions. [2019-09-07 19:12:40,352 INFO L78 Accepts]: Start accepts. Automaton has 133833 states and 236979 transitions. Word has length 296 [2019-09-07 19:12:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:12:40,353 INFO L475 AbstractCegarLoop]: Abstraction has 133833 states and 236979 transitions. [2019-09-07 19:12:40,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:12:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 133833 states and 236979 transitions. [2019-09-07 19:12:40,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-07 19:12:40,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:12:40,362 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:12:40,362 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:12:40,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:12:40,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1221284586, now seen corresponding path program 1 times [2019-09-07 19:12:40,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:12:40,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:12:40,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:12:40,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:12:40,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:12:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:12:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 171 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:12:40,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:12:40,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:12:40,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:12:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:12:40,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:12:40,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:12:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 171 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:12:40,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:12:40,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:12:40,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:12:40,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:12:40,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:12:40,786 INFO L87 Difference]: Start difference. First operand 133833 states and 236979 transitions. Second operand 9 states. [2019-09-07 19:12:55,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:12:55,887 INFO L93 Difference]: Finished difference Result 307570 states and 669450 transitions. [2019-09-07 19:12:55,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 19:12:55,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 299 [2019-09-07 19:12:55,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:12:57,461 INFO L225 Difference]: With dead ends: 307570 [2019-09-07 19:12:57,461 INFO L226 Difference]: Without dead ends: 173767 [2019-09-07 19:12:57,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-09-07 19:12:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173767 states. [2019-09-07 19:13:07,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173767 to 172140. [2019-09-07 19:13:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172140 states. [2019-09-07 19:13:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172140 states to 172140 states and 355102 transitions. [2019-09-07 19:13:10,059 INFO L78 Accepts]: Start accepts. Automaton has 172140 states and 355102 transitions. Word has length 299 [2019-09-07 19:13:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:13:10,060 INFO L475 AbstractCegarLoop]: Abstraction has 172140 states and 355102 transitions. [2019-09-07 19:13:10,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:13:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 172140 states and 355102 transitions. [2019-09-07 19:13:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-07 19:13:10,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:13:10,069 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 19:13:10,069 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:13:10,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:13:10,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1664182609, now seen corresponding path program 1 times [2019-09-07 19:13:10,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:13:10,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:13:10,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:13:10,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:13:10,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:13:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:13:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 53 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:13:10,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:13:10,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:13:10,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:13:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:13:10,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:13:10,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:13:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-07 19:13:10,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:13:10,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 19:13:10,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:13:10,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:13:10,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:13:10,503 INFO L87 Difference]: Start difference. First operand 172140 states and 355102 transitions. Second operand 9 states. [2019-09-07 19:13:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:13:34,721 INFO L93 Difference]: Finished difference Result 407878 states and 897919 transitions. [2019-09-07 19:13:34,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 19:13:34,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 300 [2019-09-07 19:13:34,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:13:35,763 INFO L225 Difference]: With dead ends: 407878 [2019-09-07 19:13:35,763 INFO L226 Difference]: Without dead ends: 236635 [2019-09-07 19:13:36,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-07 19:13:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236635 states. [2019-09-07 19:13:46,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236635 to 232378. [2019-09-07 19:13:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232378 states. [2019-09-07 19:13:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232378 states to 232378 states and 334861 transitions. [2019-09-07 19:13:48,722 INFO L78 Accepts]: Start accepts. Automaton has 232378 states and 334861 transitions. Word has length 300 [2019-09-07 19:13:48,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:13:48,723 INFO L475 AbstractCegarLoop]: Abstraction has 232378 states and 334861 transitions. [2019-09-07 19:13:48,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:13:48,723 INFO L276 IsEmpty]: Start isEmpty. Operand 232378 states and 334861 transitions. [2019-09-07 19:13:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-09-07 19:13:48,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:13:48,748 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:13:48,748 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:13:48,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:13:48,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1391122643, now seen corresponding path program 1 times [2019-09-07 19:13:48,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:13:48,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:13:48,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:13:48,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:13:48,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:13:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:13:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2019-09-07 19:13:48,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:13:48,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:13:48,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:13:48,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:13:48,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:13:48,980 INFO L87 Difference]: Start difference. First operand 232378 states and 334861 transitions. Second operand 3 states. [2019-09-07 19:14:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:14:03,670 INFO L93 Difference]: Finished difference Result 460503 states and 667495 transitions. [2019-09-07 19:14:03,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:14:03,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 427 [2019-09-07 19:14:03,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:14:04,427 INFO L225 Difference]: With dead ends: 460503 [2019-09-07 19:14:04,427 INFO L226 Difference]: Without dead ends: 238258 [2019-09-07 19:14:04,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:14:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238258 states. [2019-09-07 19:14:09,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238258 to 234948. [2019-09-07 19:14:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234948 states. [2019-09-07 19:14:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234948 states to 234948 states and 320663 transitions. [2019-09-07 19:14:09,863 INFO L78 Accepts]: Start accepts. Automaton has 234948 states and 320663 transitions. Word has length 427 [2019-09-07 19:14:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:14:09,864 INFO L475 AbstractCegarLoop]: Abstraction has 234948 states and 320663 transitions. [2019-09-07 19:14:09,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:14:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 234948 states and 320663 transitions. [2019-09-07 19:14:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1046 [2019-09-07 19:14:10,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:14:10,426 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:14:10,427 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:14:10,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:14:10,427 INFO L82 PathProgramCache]: Analyzing trace with hash 256443275, now seen corresponding path program 1 times [2019-09-07 19:14:10,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:14:10,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:14:10,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:14:10,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:14:10,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:14:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:14:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 292 proven. 94 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2019-09-07 19:14:15,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:14:15,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:14:15,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:14:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:14:15,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 1403 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:14:15,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:14:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 569 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 19:14:16,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:14:16,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:14:16,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:14:16,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:14:16,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:14:16,393 INFO L87 Difference]: Start difference. First operand 234948 states and 320663 transitions. Second operand 9 states. [2019-09-07 19:14:32,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:14:32,443 INFO L93 Difference]: Finished difference Result 461704 states and 633716 transitions. [2019-09-07 19:14:32,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 19:14:32,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1045 [2019-09-07 19:14:32,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:14:33,043 INFO L225 Difference]: With dead ends: 461704 [2019-09-07 19:14:33,043 INFO L226 Difference]: Without dead ends: 227549 [2019-09-07 19:14:33,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1064 GetRequests, 1050 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:14:33,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227549 states. [2019-09-07 19:14:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227549 to 223551. [2019-09-07 19:14:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223551 states. [2019-09-07 19:14:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223551 states to 223551 states and 280460 transitions. [2019-09-07 19:14:38,518 INFO L78 Accepts]: Start accepts. Automaton has 223551 states and 280460 transitions. Word has length 1045 [2019-09-07 19:14:38,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:14:38,519 INFO L475 AbstractCegarLoop]: Abstraction has 223551 states and 280460 transitions. [2019-09-07 19:14:38,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:14:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 223551 states and 280460 transitions. [2019-09-07 19:14:38,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1315 [2019-09-07 19:14:38,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:14:38,864 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:14:38,865 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:14:38,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:14:38,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1741096916, now seen corresponding path program 1 times [2019-09-07 19:14:38,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:14:38,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:14:38,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:14:38,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:14:38,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:14:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:14:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 116 proven. 572 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-09-07 19:14:46,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:14:46,040 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 19:14:46,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:14:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:14:46,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 1671 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:14:46,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:14:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2019-09-07 19:14:47,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:14:47,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:14:47,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:14:47,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:14:47,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:14:47,689 INFO L87 Difference]: Start difference. First operand 223551 states and 280460 transitions. Second operand 9 states. [2019-09-07 19:14:57,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:14:57,028 INFO L93 Difference]: Finished difference Result 429165 states and 520837 transitions. [2019-09-07 19:14:57,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 19:14:57,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1314 [2019-09-07 19:14:57,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:14:57,484 INFO L225 Difference]: With dead ends: 429165 [2019-09-07 19:14:57,484 INFO L226 Difference]: Without dead ends: 204003 [2019-09-07 19:14:57,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1334 GetRequests, 1320 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:14:57,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204003 states. [2019-09-07 19:15:00,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204003 to 189884. [2019-09-07 19:15:00,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189884 states. [2019-09-07 19:15:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189884 states to 189884 states and 215092 transitions. [2019-09-07 19:15:00,792 INFO L78 Accepts]: Start accepts. Automaton has 189884 states and 215092 transitions. Word has length 1314 [2019-09-07 19:15:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:15:00,793 INFO L475 AbstractCegarLoop]: Abstraction has 189884 states and 215092 transitions. [2019-09-07 19:15:00,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:15:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 189884 states and 215092 transitions. [2019-09-07 19:15:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1214 [2019-09-07 19:15:00,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:15:00,964 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:15:00,964 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:15:00,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:15:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash -167473974, now seen corresponding path program 1 times [2019-09-07 19:15:00,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:15:00,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:15:00,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:15:00,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:15:00,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:15:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:15:04,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 269 proven. 297 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2019-09-07 19:15:04,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:15:04,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:15:04,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:15:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:15:05,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:15:05,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:15:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 837 proven. 2 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2019-09-07 19:15:05,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:15:05,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:15:05,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:15:05,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:15:05,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:15:05,737 INFO L87 Difference]: Start difference. First operand 189884 states and 215092 transitions. Second operand 9 states. [2019-09-07 19:15:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:15:16,345 INFO L93 Difference]: Finished difference Result 381540 states and 430753 transitions. [2019-09-07 19:15:16,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 19:15:16,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1213 [2019-09-07 19:15:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:15:16,775 INFO L225 Difference]: With dead ends: 381540 [2019-09-07 19:15:16,775 INFO L226 Difference]: Without dead ends: 192434 [2019-09-07 19:15:17,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1232 GetRequests, 1218 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:15:17,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192434 states. [2019-09-07 19:15:19,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192434 to 186623. [2019-09-07 19:15:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186623 states. [2019-09-07 19:15:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186623 states to 186623 states and 202692 transitions. [2019-09-07 19:15:20,290 INFO L78 Accepts]: Start accepts. Automaton has 186623 states and 202692 transitions. Word has length 1213 [2019-09-07 19:15:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:15:20,291 INFO L475 AbstractCegarLoop]: Abstraction has 186623 states and 202692 transitions. [2019-09-07 19:15:20,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:15:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 186623 states and 202692 transitions. [2019-09-07 19:15:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1074 [2019-09-07 19:15:20,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:15: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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:15:20,366 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:15:20,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:15:20,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1479164441, now seen corresponding path program 1 times [2019-09-07 19:15:20,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:15:20,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:15:20,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:15:20,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:15:20,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:15:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:15:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 434 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:15:23,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:15:23,287 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 19:15:23,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:15:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:15:23,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 1434 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:15:23,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:15:23,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:15:23,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:15:23,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:15:23,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:15:23,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:15:23,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:15:23,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:15:23,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:15:23,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:15:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 531 proven. 77 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-07 19:15:24,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:15:24,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2019-09-07 19:15:24,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 19:15:24,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 19:15:24,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2019-09-07 19:15:24,816 INFO L87 Difference]: Start difference. First operand 186623 states and 202692 transitions. Second operand 24 states. [2019-09-07 19:18:26,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:18:26,973 INFO L93 Difference]: Finished difference Result 475616 states and 539353 transitions. [2019-09-07 19:18:26,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 460 states. [2019-09-07 19:18:26,974 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1073 [2019-09-07 19:18:26,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:18:27,555 INFO L225 Difference]: With dead ends: 475616 [2019-09-07 19:18:27,555 INFO L226 Difference]: Without dead ends: 282569 [2019-09-07 19:18:27,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1854 GetRequests, 1381 SyntacticMatches, 1 SemanticMatches, 472 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103275 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=13519, Invalid=210683, Unknown=0, NotChecked=0, Total=224202 [2019-09-07 19:18:27,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282569 states. [2019-09-07 19:18:31,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282569 to 261355. [2019-09-07 19:18:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261355 states. [2019-09-07 19:18:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261355 states to 261355 states and 282882 transitions. [2019-09-07 19:18:31,400 INFO L78 Accepts]: Start accepts. Automaton has 261355 states and 282882 transitions. Word has length 1073 [2019-09-07 19:18:31,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:18:31,400 INFO L475 AbstractCegarLoop]: Abstraction has 261355 states and 282882 transitions. [2019-09-07 19:18:31,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 19:18:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 261355 states and 282882 transitions. [2019-09-07 19:18:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1260 [2019-09-07 19:18:36,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:18:36,174 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:18:36,175 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:18:36,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:18:36,177 INFO L82 PathProgramCache]: Analyzing trace with hash -625846312, now seen corresponding path program 1 times [2019-09-07 19:18:36,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:18:36,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:18:36,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:18:36,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:18:36,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:18:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:18:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 681 proven. 2 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2019-09-07 19:18:38,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:18:38,316 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:18:38,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:18:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:18:38,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 1666 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:18:38,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:18:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 681 proven. 2 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2019-09-07 19:18:39,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:18:39,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:18:39,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:18:39,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:18:39,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:18:39,605 INFO L87 Difference]: Start difference. First operand 261355 states and 282882 transitions. Second operand 9 states. [2019-09-07 19:18:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:18:50,835 INFO L93 Difference]: Finished difference Result 523999 states and 569793 transitions. [2019-09-07 19:18:50,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 19:18:50,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1259 [2019-09-07 19:18:50,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:18:51,379 INFO L225 Difference]: With dead ends: 523999 [2019-09-07 19:18:51,379 INFO L226 Difference]: Without dead ends: 264189 [2019-09-07 19:18:51,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1284 GetRequests, 1269 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-09-07 19:18:51,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264189 states. [2019-09-07 19:18:55,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264189 to 262323. [2019-09-07 19:18:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262323 states. [2019-09-07 19:18:55,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262323 states to 262323 states and 281365 transitions. [2019-09-07 19:18:55,680 INFO L78 Accepts]: Start accepts. Automaton has 262323 states and 281365 transitions. Word has length 1259 [2019-09-07 19:18:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:18:55,681 INFO L475 AbstractCegarLoop]: Abstraction has 262323 states and 281365 transitions. [2019-09-07 19:18:55,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:18:55,681 INFO L276 IsEmpty]: Start isEmpty. Operand 262323 states and 281365 transitions. [2019-09-07 19:18:55,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1268 [2019-09-07 19:18:55,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:18:55,832 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:18:55,832 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:18:55,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:18:55,833 INFO L82 PathProgramCache]: Analyzing trace with hash 226713672, now seen corresponding path program 1 times [2019-09-07 19:18:55,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:18:55,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:18:55,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:18:55,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:18:55,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:18:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:18:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1450 backedges. 689 proven. 2 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2019-09-07 19:18:58,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:18:58,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:18:58,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:18:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:18:58,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 1673 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:18:58,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:19:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1450 backedges. 689 proven. 2 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2019-09-07 19:19:00,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:19:00,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 19:19:00,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:19:00,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:19:00,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:19:00,670 INFO L87 Difference]: Start difference. First operand 262323 states and 281365 transitions. Second operand 6 states. [2019-09-07 19:19:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:19:10,862 INFO L93 Difference]: Finished difference Result 559172 states and 602125 transitions. [2019-09-07 19:19:10,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 19:19:10,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1267 [2019-09-07 19:19:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:19:12,454 INFO L225 Difference]: With dead ends: 559172 [2019-09-07 19:19:12,454 INFO L226 Difference]: Without dead ends: 298394 [2019-09-07 19:19:12,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1285 GetRequests, 1276 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:19:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298394 states. [2019-09-07 19:19:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298394 to 290313. [2019-09-07 19:19:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290313 states. [2019-09-07 19:19:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290313 states to 290313 states and 310613 transitions. [2019-09-07 19:19:21,291 INFO L78 Accepts]: Start accepts. Automaton has 290313 states and 310613 transitions. Word has length 1267 [2019-09-07 19:19:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:19:21,292 INFO L475 AbstractCegarLoop]: Abstraction has 290313 states and 310613 transitions. [2019-09-07 19:19:21,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:19:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 290313 states and 310613 transitions. [2019-09-07 19:19:21,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1305 [2019-09-07 19:19:21,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:19:21,552 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:19:21,552 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:19:21,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:19:21,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1686589003, now seen corresponding path program 1 times [2019-09-07 19:19:21,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:19:21,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:19:21,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:19:21,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:19:21,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:19:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:19:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 880 proven. 448 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 19:19:30,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:19:30,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:19:30,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:19:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:19:30,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 1703 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:19:30,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:19:31,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:19:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 856 trivial. 0 not checked. [2019-09-07 19:19:31,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:19:31,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 22 [2019-09-07 19:19:31,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 19:19:31,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 19:19:31,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-09-07 19:19:31,979 INFO L87 Difference]: Start difference. First operand 290313 states and 310613 transitions. Second operand 22 states. [2019-09-07 19:19:54,208 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-07 19:19:58,341 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-07 19:20:03,526 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-07 19:20:05,964 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-07 19:20:10,020 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-07 19:20:12,081 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-07 19:20:13,602 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-07 19:20:16,451 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-07 19:20:42,296 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-07 19:20:42,711 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-07 19:20:46,877 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-07 19:20:48,730 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-07 19:20:50,354 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-07 19:20:58,325 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-07 19:21:04,314 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-07 19:21:09,271 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-07 19:21:14,965 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-07 19:21:17,682 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-07 19:21:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:21:49,147 INFO L93 Difference]: Finished difference Result 582934 states and 620916 transitions. [2019-09-07 19:21:49,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 289 states. [2019-09-07 19:21:49,147 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1304 [2019-09-07 19:21:49,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:21:49,653 INFO L225 Difference]: With dead ends: 582934 [2019-09-07 19:21:49,654 INFO L226 Difference]: Without dead ends: 293394 [2019-09-07 19:21:49,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1861 GetRequests, 1563 SyntacticMatches, 0 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38870 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=7332, Invalid=82368, Unknown=0, NotChecked=0, Total=89700 [2019-09-07 19:21:50,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293394 states. [2019-09-07 19:21:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293394 to 283187. [2019-09-07 19:21:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283187 states. [2019-09-07 19:21:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283187 states to 283187 states and 298296 transitions. [2019-09-07 19:21:53,561 INFO L78 Accepts]: Start accepts. Automaton has 283187 states and 298296 transitions. Word has length 1304 [2019-09-07 19:21:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:21:53,562 INFO L475 AbstractCegarLoop]: Abstraction has 283187 states and 298296 transitions. [2019-09-07 19:21:53,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 19:21:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 283187 states and 298296 transitions. [2019-09-07 19:21:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1290 [2019-09-07 19:21:53,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:21:53,762 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:21:53,762 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:21:53,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:21:53,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1172231300, now seen corresponding path program 1 times [2019-09-07 19:21:53,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:21:53,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:21:53,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:21:53,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:21:53,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:21:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:22:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 1027 proven. 337 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-09-07 19:22:05,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:22:05,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:22:05,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:22:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:22:05,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 1695 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 19:22:05,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:22:05,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:22:05,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:22:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 1152 proven. 2 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-09-07 19:22:10,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:22:10,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 5] total 32 [2019-09-07 19:22:10,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 19:22:10,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 19:22:10,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2019-09-07 19:22:10,351 INFO L87 Difference]: Start difference. First operand 283187 states and 298296 transitions. Second operand 32 states.