java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label39.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:46:28,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:46:28,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:46:28,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:46:28,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:46:28,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:46:28,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:46:28,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:46:28,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:46:28,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:46:28,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:46:28,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:46:28,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:46:28,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:46:28,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:46:28,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:46:28,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:46:28,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:46:28,868 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:46:28,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:46:28,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:46:28,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:46:28,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:46:28,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:46:28,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:46:28,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:46:28,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:46:28,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:46:28,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:46:28,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:46:28,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:46:28,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:46:28,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:46:28,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:46:28,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:46:28,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:46:28,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:46:28,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:46:28,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:46:28,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:46:28,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:46:28,888 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:46:28,902 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:46:28,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:46:28,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:46:28,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:46:28,904 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:46:28,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:46:28,904 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:46:28,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:46:28,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:46:28,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:46:28,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:46:28,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:46:28,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:46:28,906 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:46:28,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:46:28,907 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:46:28,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:46:28,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:46:28,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:46:28,907 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:46:28,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:46:28,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:46:28,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:46:28,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:46:28,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:46:28,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:46:28,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:46:28,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:46:28,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:46:28,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:46:28,978 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:46:28,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:46:28,984 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:46:28,984 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:46:28,985 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label39.c [2019-09-07 19:46:29,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d40738830/fd55da1175764d838a877367084fcf26/FLAGf30baa961 [2019-09-07 19:46:29,854 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:46:29,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label39.c [2019-09-07 19:46:29,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d40738830/fd55da1175764d838a877367084fcf26/FLAGf30baa961 [2019-09-07 19:46:30,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d40738830/fd55da1175764d838a877367084fcf26 [2019-09-07 19:46:30,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:46:30,406 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:46:30,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:46:30,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:46:30,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:46:30,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:46:30" (1/1) ... [2019-09-07 19:46:30,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5061f25e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:30, skipping insertion in model container [2019-09-07 19:46:30,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:46:30" (1/1) ... [2019-09-07 19:46:30,422 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:46:30,600 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:46:32,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:46:32,149 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:46:32,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:46:32,911 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:46:32,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:32 WrapperNode [2019-09-07 19:46:32,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:46:32,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:46:32,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:46:32,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:46:32,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:32" (1/1) ... [2019-09-07 19:46:32,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:32" (1/1) ... [2019-09-07 19:46:33,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:32" (1/1) ... [2019-09-07 19:46:33,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:32" (1/1) ... [2019-09-07 19:46:33,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:32" (1/1) ... [2019-09-07 19:46:33,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:32" (1/1) ... [2019-09-07 19:46:33,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:32" (1/1) ... [2019-09-07 19:46:33,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:46:33,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:46:33,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:46:33,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:46:33,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:32" (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:46:33,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:46:33,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:46:33,301 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:46:33,301 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:46:33,301 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:46:33,302 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:46:33,302 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:46:33,302 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:46:33,302 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:46:33,302 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:46:33,302 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:46:33,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:46:33,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:46:33,303 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:46:33,303 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:46:33,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:46:33,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:46:39,972 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:46:39,972 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:46:39,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:46:39 BoogieIcfgContainer [2019-09-07 19:46:39,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:46:39,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:46:39,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:46:39,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:46:39,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:46:30" (1/3) ... [2019-09-07 19:46:39,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f23765b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:46:39, skipping insertion in model container [2019-09-07 19:46:39,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:32" (2/3) ... [2019-09-07 19:46:39,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f23765b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:46:39, skipping insertion in model container [2019-09-07 19:46:39,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:46:39" (3/3) ... [2019-09-07 19:46:39,985 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label39.c [2019-09-07 19:46:39,995 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:46:40,010 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:46:40,029 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:46:40,090 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:46:40,091 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:46:40,091 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:46:40,091 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:46:40,091 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:46:40,091 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:46:40,092 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:46:40,092 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:46:40,092 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:46:40,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:46:40,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 19:46:40,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:46:40,147 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:46:40,149 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:46:40,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:46:40,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1910105920, now seen corresponding path program 1 times [2019-09-07 19:46:40,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:46:40,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:46:40,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:40,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:40,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:40,506 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:46:40,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:46:40,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:46:40,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:46:40,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:46:40,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:46:40,532 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 19:46:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:46:46,167 INFO L93 Difference]: Finished difference Result 3094 states and 5704 transitions. [2019-09-07 19:46:46,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:46:46,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-07 19:46:46,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:46:46,205 INFO L225 Difference]: With dead ends: 3094 [2019-09-07 19:46:46,205 INFO L226 Difference]: Without dead ends: 1913 [2019-09-07 19:46:46,219 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:46:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2019-09-07 19:46:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1912. [2019-09-07 19:46:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2019-09-07 19:46:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 3141 transitions. [2019-09-07 19:46:46,404 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 3141 transitions. Word has length 57 [2019-09-07 19:46:46,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:46:46,405 INFO L475 AbstractCegarLoop]: Abstraction has 1912 states and 3141 transitions. [2019-09-07 19:46:46,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:46:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 3141 transitions. [2019-09-07 19:46:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-07 19:46:46,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:46:46,424 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:46:46,424 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:46:46,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:46:46,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1148002277, now seen corresponding path program 1 times [2019-09-07 19:46:46,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:46:46,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:46:46,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:46,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:46,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:46:46,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:46:46,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:46:46,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:46:46,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:46:46,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:46:46,683 INFO L87 Difference]: Start difference. First operand 1912 states and 3141 transitions. Second operand 5 states. [2019-09-07 19:46:55,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:46:55,955 INFO L93 Difference]: Finished difference Result 5589 states and 9299 transitions. [2019-09-07 19:46:55,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:46:55,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-09-07 19:46:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:46:55,989 INFO L225 Difference]: With dead ends: 5589 [2019-09-07 19:46:55,990 INFO L226 Difference]: Without dead ends: 3683 [2019-09-07 19:46:55,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:46:56,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2019-09-07 19:46:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 3601. [2019-09-07 19:46:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3601 states. [2019-09-07 19:46:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3601 states and 5413 transitions. [2019-09-07 19:46:56,126 INFO L78 Accepts]: Start accepts. Automaton has 3601 states and 5413 transitions. Word has length 132 [2019-09-07 19:46:56,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:46:56,129 INFO L475 AbstractCegarLoop]: Abstraction has 3601 states and 5413 transitions. [2019-09-07 19:46:56,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:46:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3601 states and 5413 transitions. [2019-09-07 19:46:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-07 19:46:56,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:46:56,134 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:46:56,134 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:46:56,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:46:56,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1306751103, now seen corresponding path program 1 times [2019-09-07 19:46:56,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:46:56,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:46:56,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:56,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:56,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:46:56,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:46:56,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:46:56,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:46:56,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:46:56,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:46:56,334 INFO L87 Difference]: Start difference. First operand 3601 states and 5413 transitions. Second operand 5 states. [2019-09-07 19:47:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:47:06,658 INFO L93 Difference]: Finished difference Result 10901 states and 16894 transitions. [2019-09-07 19:47:06,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:47:06,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-09-07 19:47:06,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:47:06,702 INFO L225 Difference]: With dead ends: 10901 [2019-09-07 19:47:06,705 INFO L226 Difference]: Without dead ends: 7306 [2019-09-07 19:47:06,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:47:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-09-07 19:47:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7121. [2019-09-07 19:47:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7121 states. [2019-09-07 19:47:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7121 states to 7121 states and 10497 transitions. [2019-09-07 19:47:06,934 INFO L78 Accepts]: Start accepts. Automaton has 7121 states and 10497 transitions. Word has length 146 [2019-09-07 19:47:06,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:47:06,936 INFO L475 AbstractCegarLoop]: Abstraction has 7121 states and 10497 transitions. [2019-09-07 19:47:06,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:47:06,937 INFO L276 IsEmpty]: Start isEmpty. Operand 7121 states and 10497 transitions. [2019-09-07 19:47:06,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-07 19:47:06,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:47:06,940 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:47:06,940 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:47:06,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:47:06,941 INFO L82 PathProgramCache]: Analyzing trace with hash -589434587, now seen corresponding path program 1 times [2019-09-07 19:47:06,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:47:06,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:47:06,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:06,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:47:06,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:47:07,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:47:07,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:47:07,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:47:07,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:47:07,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:47:07,166 INFO L87 Difference]: Start difference. First operand 7121 states and 10497 transitions. Second operand 6 states. [2019-09-07 19:47:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:47:14,869 INFO L93 Difference]: Finished difference Result 21450 states and 33775 transitions. [2019-09-07 19:47:14,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:47:14,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-09-07 19:47:14,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:47:14,984 INFO L225 Difference]: With dead ends: 21450 [2019-09-07 19:47:14,985 INFO L226 Difference]: Without dead ends: 14335 [2019-09-07 19:47:15,016 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:47:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14335 states. [2019-09-07 19:47:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14335 to 14126. [2019-09-07 19:47:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14126 states. [2019-09-07 19:47:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14126 states to 14126 states and 21305 transitions. [2019-09-07 19:47:15,533 INFO L78 Accepts]: Start accepts. Automaton has 14126 states and 21305 transitions. Word has length 164 [2019-09-07 19:47:15,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:47:15,534 INFO L475 AbstractCegarLoop]: Abstraction has 14126 states and 21305 transitions. [2019-09-07 19:47:15,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:47:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 14126 states and 21305 transitions. [2019-09-07 19:47:15,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-07 19:47:15,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:47:15,538 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:47:15,538 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:47:15,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:47:15,539 INFO L82 PathProgramCache]: Analyzing trace with hash -724485451, now seen corresponding path program 1 times [2019-09-07 19:47:15,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:47:15,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:47:15,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:15,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:47:15,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:47:15,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:47:15,741 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:47:15,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:47:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:15,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 19:47:15,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:47:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:47:16,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:47:16,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-09-07 19:47:16,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:47:16,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:47:16,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:47:16,092 INFO L87 Difference]: Start difference. First operand 14126 states and 21305 transitions. Second operand 8 states. [2019-09-07 19:47:31,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:47:31,777 INFO L93 Difference]: Finished difference Result 52926 states and 83549 transitions. [2019-09-07 19:47:31,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 19:47:31,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 172 [2019-09-07 19:47:31,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:47:31,962 INFO L225 Difference]: With dead ends: 52926 [2019-09-07 19:47:31,962 INFO L226 Difference]: Without dead ends: 38806 [2019-09-07 19:47:32,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-09-07 19:47:32,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38806 states. [2019-09-07 19:47:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38806 to 36747. [2019-09-07 19:47:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36747 states. [2019-09-07 19:47:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36747 states to 36747 states and 51446 transitions. [2019-09-07 19:47:33,204 INFO L78 Accepts]: Start accepts. Automaton has 36747 states and 51446 transitions. Word has length 172 [2019-09-07 19:47:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:47:33,204 INFO L475 AbstractCegarLoop]: Abstraction has 36747 states and 51446 transitions. [2019-09-07 19:47:33,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:47:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 36747 states and 51446 transitions. [2019-09-07 19:47:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-07 19:47:33,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:47:33,211 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:47:33,212 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:47:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:47:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1601350895, now seen corresponding path program 1 times [2019-09-07 19:47:33,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:47:33,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:47:33,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:33,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:47:33,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:47:33,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:47:33,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:47:33,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:47:33,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:47:33,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:47:33,497 INFO L87 Difference]: Start difference. First operand 36747 states and 51446 transitions. Second operand 6 states. [2019-09-07 19:47:42,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:47:42,168 INFO L93 Difference]: Finished difference Result 82263 states and 124567 transitions. [2019-09-07 19:47:42,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:47:42,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-09-07 19:47:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:47:42,344 INFO L225 Difference]: With dead ends: 82263 [2019-09-07 19:47:42,345 INFO L226 Difference]: Without dead ends: 45522 [2019-09-07 19:47:42,412 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:47:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45522 states. [2019-09-07 19:47:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45522 to 45003. [2019-09-07 19:47:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45003 states. [2019-09-07 19:47:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45003 states to 45003 states and 63608 transitions. [2019-09-07 19:47:43,376 INFO L78 Accepts]: Start accepts. Automaton has 45003 states and 63608 transitions. Word has length 203 [2019-09-07 19:47:43,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:47:43,378 INFO L475 AbstractCegarLoop]: Abstraction has 45003 states and 63608 transitions. [2019-09-07 19:47:43,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:47:43,381 INFO L276 IsEmpty]: Start isEmpty. Operand 45003 states and 63608 transitions. [2019-09-07 19:47:43,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-07 19:47:43,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:47:43,389 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 19:47:43,389 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:47:43,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:47:43,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2028444081, now seen corresponding path program 1 times [2019-09-07 19:47:43,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:47:43,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:47:43,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:43,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:47:43,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 100 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:47:43,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:47:43,535 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:47:43,556 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:47:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:44,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:47:44,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:47:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-07 19:47:44,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:47:44,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:47:44,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:47:44,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:47:44,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:47:44,986 INFO L87 Difference]: Start difference. First operand 45003 states and 63608 transitions. Second operand 9 states. [2019-09-07 19:48:00,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:48:00,934 INFO L93 Difference]: Finished difference Result 137517 states and 214852 transitions. [2019-09-07 19:48:00,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 19:48:00,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 208 [2019-09-07 19:48:00,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:48:01,319 INFO L225 Difference]: With dead ends: 137517 [2019-09-07 19:48:01,320 INFO L226 Difference]: Without dead ends: 92520 [2019-09-07 19:48:01,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 19:48:01,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92520 states. [2019-09-07 19:48:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92520 to 82391. [2019-09-07 19:48:03,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82391 states. [2019-09-07 19:48:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82391 states to 82391 states and 113869 transitions. [2019-09-07 19:48:03,220 INFO L78 Accepts]: Start accepts. Automaton has 82391 states and 113869 transitions. Word has length 208 [2019-09-07 19:48:03,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:48:03,221 INFO L475 AbstractCegarLoop]: Abstraction has 82391 states and 113869 transitions. [2019-09-07 19:48:03,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:48:03,221 INFO L276 IsEmpty]: Start isEmpty. Operand 82391 states and 113869 transitions. [2019-09-07 19:48:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-07 19:48:03,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:48:03,228 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:48:03,228 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:48:03,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:48:03,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1057179256, now seen corresponding path program 1 times [2019-09-07 19:48:03,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:48:03,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:48:03,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:03,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:48:03,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:03,494 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:48:03,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:48:03,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:48:03,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:48:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:03,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:48:03,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:48:03,689 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:48:03,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:48:03,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:48:03,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:48:03,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:48:03,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:48:03,702 INFO L87 Difference]: Start difference. First operand 82391 states and 113869 transitions. Second operand 9 states. [2019-09-07 19:48:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:48:28,962 INFO L93 Difference]: Finished difference Result 229281 states and 383501 transitions. [2019-09-07 19:48:28,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 19:48:28,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 255 [2019-09-07 19:48:28,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:48:29,835 INFO L225 Difference]: With dead ends: 229281 [2019-09-07 19:48:29,836 INFO L226 Difference]: Without dead ends: 145187 [2019-09-07 19:48:30,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-07 19:48:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145187 states. [2019-09-07 19:48:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145187 to 142261. [2019-09-07 19:48:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142261 states. [2019-09-07 19:48:33,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142261 states to 142261 states and 196321 transitions. [2019-09-07 19:48:33,215 INFO L78 Accepts]: Start accepts. Automaton has 142261 states and 196321 transitions. Word has length 255 [2019-09-07 19:48:33,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:48:33,215 INFO L475 AbstractCegarLoop]: Abstraction has 142261 states and 196321 transitions. [2019-09-07 19:48:33,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:48:33,216 INFO L276 IsEmpty]: Start isEmpty. Operand 142261 states and 196321 transitions. [2019-09-07 19:48:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-07 19:48:33,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:48:33,223 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:48:33,223 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:48:33,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:48:33,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1218681496, now seen corresponding path program 1 times [2019-09-07 19:48:33,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:48:33,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:48:33,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:33,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:48:33,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 143 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:48:33,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:48:33,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:48:33,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:48:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:33,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 19:48:33,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:48:33,784 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 104 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-07 19:48:33,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:48:33,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-09-07 19:48:33,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:48:33,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:48:33,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:48:33,797 INFO L87 Difference]: Start difference. First operand 142261 states and 196321 transitions. Second operand 12 states. [2019-09-07 19:49:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:49:07,576 INFO L93 Difference]: Finished difference Result 380670 states and 631010 transitions. [2019-09-07 19:49:07,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 19:49:07,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 262 [2019-09-07 19:49:07,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:49:09,271 INFO L225 Difference]: With dead ends: 380670 [2019-09-07 19:49:09,271 INFO L226 Difference]: Without dead ends: 240036 [2019-09-07 19:49:09,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=326, Invalid=934, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 19:49:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240036 states. [2019-09-07 19:49:19,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240036 to 227111. [2019-09-07 19:49:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227111 states. [2019-09-07 19:49:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227111 states to 227111 states and 323775 transitions. [2019-09-07 19:49:19,896 INFO L78 Accepts]: Start accepts. Automaton has 227111 states and 323775 transitions. Word has length 262 [2019-09-07 19:49:19,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:49:19,897 INFO L475 AbstractCegarLoop]: Abstraction has 227111 states and 323775 transitions. [2019-09-07 19:49:19,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 19:49:19,897 INFO L276 IsEmpty]: Start isEmpty. Operand 227111 states and 323775 transitions. [2019-09-07 19:49:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-09-07 19:49:19,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:49:19,905 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:49:19,905 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:49:19,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:49:19,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1861935488, now seen corresponding path program 1 times [2019-09-07 19:49:19,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:49:19,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:49:19,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:49:19,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:49:19,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:49:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:49:20,129 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 96 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:49:20,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:49:20,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:49:20,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:49:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:49:20,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:49:20,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:49:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 19:49:20,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:49:20,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 19:49:20,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:49:20,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:49:20,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:49:20,279 INFO L87 Difference]: Start difference. First operand 227111 states and 323775 transitions. Second operand 9 states. [2019-09-07 19:49:42,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:49:42,417 INFO L93 Difference]: Finished difference Result 505064 states and 715609 transitions. [2019-09-07 19:49:42,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 19:49:42,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 285 [2019-09-07 19:49:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:49:43,573 INFO L225 Difference]: With dead ends: 505064 [2019-09-07 19:49:43,573 INFO L226 Difference]: Without dead ends: 279583 [2019-09-07 19:49:43,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 294 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-09-07 19:49:44,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279583 states. [2019-09-07 19:49:53,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279583 to 227924. [2019-09-07 19:49:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227924 states. [2019-09-07 19:49:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227924 states to 227924 states and 299942 transitions. [2019-09-07 19:49:54,448 INFO L78 Accepts]: Start accepts. Automaton has 227924 states and 299942 transitions. Word has length 285 [2019-09-07 19:49:54,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:49:54,449 INFO L475 AbstractCegarLoop]: Abstraction has 227924 states and 299942 transitions. [2019-09-07 19:49:54,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:49:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 227924 states and 299942 transitions. [2019-09-07 19:49:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-07 19:49:54,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:49:54,458 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:49:54,458 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:49:54,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:49:54,459 INFO L82 PathProgramCache]: Analyzing trace with hash -502237147, now seen corresponding path program 1 times [2019-09-07 19:49:54,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:49:54,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:49:54,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:49:54,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:49:54,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:49:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:49:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-09-07 19:49:54,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:49:54,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:49:54,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:49:54,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:49:54,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:49:54,625 INFO L87 Difference]: Start difference. First operand 227924 states and 299942 transitions. Second operand 4 states. [2019-09-07 19:50:05,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:50:05,969 INFO L93 Difference]: Finished difference Result 489702 states and 656342 transitions. [2019-09-07 19:50:05,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:50:05,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-09-07 19:50:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:50:06,738 INFO L225 Difference]: With dead ends: 489702 [2019-09-07 19:50:06,739 INFO L226 Difference]: Without dead ends: 261693 [2019-09-07 19:50:07,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:50:07,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261693 states. [2019-09-07 19:50:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261693 to 254374. [2019-09-07 19:50:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254374 states. [2019-09-07 19:50:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254374 states to 254374 states and 327610 transitions. [2019-09-07 19:50:17,180 INFO L78 Accepts]: Start accepts. Automaton has 254374 states and 327610 transitions. Word has length 302 [2019-09-07 19:50:17,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:50:17,180 INFO L475 AbstractCegarLoop]: Abstraction has 254374 states and 327610 transitions. [2019-09-07 19:50:17,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:50:17,181 INFO L276 IsEmpty]: Start isEmpty. Operand 254374 states and 327610 transitions. [2019-09-07 19:50:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-07 19:50:17,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:17,190 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:50:17,190 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:17,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:17,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1297410048, now seen corresponding path program 1 times [2019-09-07 19:50:17,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:17,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:17,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:17,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:17,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 241 proven. 72 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 19:50:17,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:50:17,498 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) [2019-09-07 19:50:17,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:50:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:17,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 19:50:17,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:50:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-09-07 19:50:17,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:50:17,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:50:17,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:50:17,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:50:17,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:50:17,764 INFO L87 Difference]: Start difference. First operand 254374 states and 327610 transitions. Second operand 9 states. [2019-09-07 19:50:19,470 WARN L188 SmtUtils]: Spent 657.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-09-07 19:50:50,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:50:50,570 INFO L93 Difference]: Finished difference Result 577494 states and 822706 transitions. [2019-09-07 19:50:50,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 19:50:50,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 338 [2019-09-07 19:50:50,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:50:51,883 INFO L225 Difference]: With dead ends: 577494 [2019-09-07 19:50:51,883 INFO L226 Difference]: Without dead ends: 324768 [2019-09-07 19:50:52,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=403, Invalid=1853, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 19:50:52,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324768 states. [2019-09-07 19:51:00,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324768 to 314438. [2019-09-07 19:51:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314438 states. [2019-09-07 19:51:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314438 states to 314438 states and 419488 transitions. [2019-09-07 19:51:01,487 INFO L78 Accepts]: Start accepts. Automaton has 314438 states and 419488 transitions. Word has length 338 [2019-09-07 19:51:01,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:51:01,488 INFO L475 AbstractCegarLoop]: Abstraction has 314438 states and 419488 transitions. [2019-09-07 19:51:01,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:51:01,488 INFO L276 IsEmpty]: Start isEmpty. Operand 314438 states and 419488 transitions. [2019-09-07 19:51:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-09-07 19:51:01,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:51:01,502 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:51:01,502 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:51:01,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:51:01,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1412368896, now seen corresponding path program 1 times [2019-09-07 19:51:01,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:51:01,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:51:01,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:51:01,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:51:01,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:51:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:51:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 349 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 19:51:01,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:51:01,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:51:01,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:51:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:51:02,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:51:02,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:51:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 349 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 19:51:07,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:51:07,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:51:07,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:51:07,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:51:07,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:51:07,336 INFO L87 Difference]: Start difference. First operand 314438 states and 419488 transitions. Second operand 9 states. [2019-09-07 19:51:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:51:31,165 INFO L93 Difference]: Finished difference Result 675953 states and 870121 transitions. [2019-09-07 19:51:31,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 19:51:31,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 401 [2019-09-07 19:51:31,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:51:32,075 INFO L225 Difference]: With dead ends: 675953 [2019-09-07 19:51:32,075 INFO L226 Difference]: Without dead ends: 359923 [2019-09-07 19:51:33,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=1057, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 19:51:33,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359923 states. [2019-09-07 19:51:42,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359923 to 329672. [2019-09-07 19:51:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329672 states. [2019-09-07 19:51:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329672 states to 329672 states and 368473 transitions. [2019-09-07 19:51:43,634 INFO L78 Accepts]: Start accepts. Automaton has 329672 states and 368473 transitions. Word has length 401 [2019-09-07 19:51:43,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:51:43,635 INFO L475 AbstractCegarLoop]: Abstraction has 329672 states and 368473 transitions. [2019-09-07 19:51:43,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:51:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand 329672 states and 368473 transitions. [2019-09-07 19:51:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2019-09-07 19:51:43,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:51:43,646 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:43,646 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:51:43,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:51:43,646 INFO L82 PathProgramCache]: Analyzing trace with hash 536046488, now seen corresponding path program 1 times [2019-09-07 19:51:43,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:51:43,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:51:43,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:51:43,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:51:43,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:51:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:51:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2019-09-07 19:51:43,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:51:43,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:51:43,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:51:43,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:51:43,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:51:43,956 INFO L87 Difference]: Start difference. First operand 329672 states and 368473 transitions. Second operand 4 states. [2019-09-07 19:51:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:51:58,722 INFO L93 Difference]: Finished difference Result 705085 states and 793618 transitions. [2019-09-07 19:51:58,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:51:58,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 463 [2019-09-07 19:51:58,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:51:59,708 INFO L225 Difference]: With dead ends: 705085 [2019-09-07 19:51:59,709 INFO L226 Difference]: Without dead ends: 400501 [2019-09-07 19:52:00,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:52:01,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400501 states. [2019-09-07 19:52:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400501 to 388430. [2019-09-07 19:52:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388430 states. [2019-09-07 19:52:06,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388430 states to 388430 states and 434041 transitions. [2019-09-07 19:52:06,745 INFO L78 Accepts]: Start accepts. Automaton has 388430 states and 434041 transitions. Word has length 463 [2019-09-07 19:52:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:52:06,745 INFO L475 AbstractCegarLoop]: Abstraction has 388430 states and 434041 transitions. [2019-09-07 19:52:06,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:52:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 388430 states and 434041 transitions. [2019-09-07 19:52:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2019-09-07 19:52:06,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:52:06,823 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2019-09-07 19:52:06,823 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:52:06,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:52:06,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1191993906, now seen corresponding path program 1 times [2019-09-07 19:52:06,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:52:06,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:52:06,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:52:06,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:52:06,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:52:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:52:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 467 proven. 209 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2019-09-07 19:52:12,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:52:12,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:52:12,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:52:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:52:12,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:52:12,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:52:12,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:52:12,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:52:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 964 proven. 6 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:52:13,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:52:13,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-09-07 19:52:13,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 19:52:13,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 19:52:13,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-07 19:52:13,148 INFO L87 Difference]: Start difference. First operand 388430 states and 434041 transitions. Second operand 10 states. [2019-09-07 19:52:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:52:44,906 INFO L93 Difference]: Finished difference Result 954024 states and 1110205 transitions. [2019-09-07 19:52:44,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 19:52:44,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 684 [2019-09-07 19:52:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:52:47,538 INFO L225 Difference]: With dead ends: 954024 [2019-09-07 19:52:47,539 INFO L226 Difference]: Without dead ends: 587436 [2019-09-07 19:52:47,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2019-09-07 19:52:48,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587436 states. [2019-09-07 19:53:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587436 to 562995. [2019-09-07 19:53:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562995 states. [2019-09-07 19:53:11,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562995 states to 562995 states and 624000 transitions. [2019-09-07 19:53:11,639 INFO L78 Accepts]: Start accepts. Automaton has 562995 states and 624000 transitions. Word has length 684 [2019-09-07 19:53:11,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:53:11,640 INFO L475 AbstractCegarLoop]: Abstraction has 562995 states and 624000 transitions. [2019-09-07 19:53:11,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 19:53:11,640 INFO L276 IsEmpty]: Start isEmpty. Operand 562995 states and 624000 transitions. [2019-09-07 19:53:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2019-09-07 19:53:11,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:53:11,726 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:53:11,726 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:53:11,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:53:11,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1702354397, now seen corresponding path program 1 times [2019-09-07 19:53:11,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:53:11,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:53:11,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:53:11,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:53:11,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:53:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:53:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 511 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-07 19:53:13,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:53:13,195 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:53:13,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:53:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:53:13,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:53:13,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:53:13,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:53:13,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:53:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 464 proven. 49 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-07 19:53:13,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:53:13,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-09-07 19:53:13,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:53:13,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:53:13,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:53:13,950 INFO L87 Difference]: Start difference. First operand 562995 states and 624000 transitions. Second operand 9 states. [2019-09-07 19:53:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:53:40,761 INFO L93 Difference]: Finished difference Result 1280900 states and 1475355 transitions. [2019-09-07 19:53:40,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 19:53:40,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 733 [2019-09-07 19:53:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:53:43,314 INFO L225 Difference]: With dead ends: 1280900 [2019-09-07 19:53:43,315 INFO L226 Difference]: Without dead ends: 742993 [2019-09-07 19:53:45,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 739 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-07 19:53:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742993 states. [2019-09-07 19:54:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742993 to 700453. [2019-09-07 19:54:06,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700453 states. [2019-09-07 19:54:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700453 states to 700453 states and 776005 transitions. [2019-09-07 19:54:18,938 INFO L78 Accepts]: Start accepts. Automaton has 700453 states and 776005 transitions. Word has length 733 [2019-09-07 19:54:18,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:54:18,939 INFO L475 AbstractCegarLoop]: Abstraction has 700453 states and 776005 transitions. [2019-09-07 19:54:18,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:54:18,939 INFO L276 IsEmpty]: Start isEmpty. Operand 700453 states and 776005 transitions. [2019-09-07 19:54:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2019-09-07 19:54:19,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:54:19,001 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:54:19,001 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:54:19,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:54:19,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2073662712, now seen corresponding path program 1 times [2019-09-07 19:54:19,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:54:19,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:54:19,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:54:19,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:54:19,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:54:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:54:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 245 proven. 133 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 19:54:20,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:54:20,916 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:54:20,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:54:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:54:21,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:54:21,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:54:21,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:54:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-09-07 19:54:22,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:54:22,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:54:22,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:54:22,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:54:22,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:54:22,053 INFO L87 Difference]: Start difference. First operand 700453 states and 776005 transitions. Second operand 9 states. [2019-09-07 19:54:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:54:46,742 INFO L93 Difference]: Finished difference Result 1497686 states and 1661900 transitions. [2019-09-07 19:54:46,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 19:54:46,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 734 [2019-09-07 19:54:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:54:48,810 INFO L225 Difference]: With dead ends: 1497686 [2019-09-07 19:54:48,811 INFO L226 Difference]: Without dead ends: 802093 [2019-09-07 19:54:49,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2019-09-07 19:55:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802093 states. [2019-09-07 19:55:10,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802093 to 774294. [2019-09-07 19:55:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774294 states. [2019-09-07 19:55:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774294 states to 774294 states and 855304 transitions. [2019-09-07 19:55:22,368 INFO L78 Accepts]: Start accepts. Automaton has 774294 states and 855304 transitions. Word has length 734 [2019-09-07 19:55:22,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:55:22,368 INFO L475 AbstractCegarLoop]: Abstraction has 774294 states and 855304 transitions. [2019-09-07 19:55:22,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:55:22,368 INFO L276 IsEmpty]: Start isEmpty. Operand 774294 states and 855304 transitions. [2019-09-07 19:55:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1022 [2019-09-07 19:55:22,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:55:22,520 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:55:22,520 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:55:22,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:55:22,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2082223392, now seen corresponding path program 1 times [2019-09-07 19:55:22,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:55:22,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:55:22,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:55:22,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:55:22,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:55:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:55:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 152 proven. 110 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2019-09-07 19:55:26,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:55:26,304 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:55:26,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:55:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:55:26,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 19:55:26,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:55:26,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:55:26,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:55:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 16 proven. 152 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2019-09-07 19:55:28,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:55:28,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-09-07 19:55:28,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:55:28,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:55:28,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:55:28,032 INFO L87 Difference]: Start difference. First operand 774294 states and 855304 transitions. Second operand 12 states. [2019-09-07 19:56:02,439 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 23 [2019-09-07 19:56:36,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:56:36,532 INFO L93 Difference]: Finished difference Result 1952575 states and 2237592 transitions. [2019-09-07 19:56:36,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 19:56:36,532 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1021 [2019-09-07 19:56:36,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:56:40,738 INFO L225 Difference]: With dead ends: 1952575 [2019-09-07 19:56:40,739 INFO L226 Difference]: Without dead ends: 1199247 [2019-09-07 19:56:41,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1061 GetRequests, 1025 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=319, Invalid=1013, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 19:56:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199247 states.