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/Problem03_label20.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:20:13,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:20:13,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:20:13,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:20:13,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:20:13,765 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:20:13,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:20:13,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:20:13,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:20:13,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:20:13,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:20:13,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:20:13,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:20:13,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:20:13,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:20:13,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:20:13,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:20:13,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:20:13,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:20:13,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:20:13,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:20:13,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:20:13,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:20:13,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:20:13,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:20:13,808 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:20:13,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:20:13,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:20:13,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:20:13,814 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:20:13,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:20:13,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:20:13,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:20:13,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:20:13,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:20:13,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:20:13,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:20:13,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:20:13,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:20:13,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:20:13,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:20:13,827 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 13:20:13,850 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:20:13,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:20:13,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:20:13,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:20:13,853 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:20:13,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:20:13,854 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:20:13,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:20:13,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:20:13,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:20:13,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:20:13,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:20:13,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:20:13,856 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:20:13,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:20:13,857 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:20:13,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:20:13,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:20:13,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:20:13,857 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:20:13,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:20:13,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:20:13,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:20:13,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:20:13,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:20:13,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:20:13,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:20:13,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:20:13,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:20:13,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:20:13,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:20:13,933 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:20:13,935 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:20:13,936 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:20:13,937 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label20.c [2019-09-07 13:20:14,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3f6a6bb/57144bd94bd54d2d8b5766ffb3ef194a/FLAG30878f4c4 [2019-09-07 13:20:14,599 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:20:14,600 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label20.c [2019-09-07 13:20:14,624 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3f6a6bb/57144bd94bd54d2d8b5766ffb3ef194a/FLAG30878f4c4 [2019-09-07 13:20:14,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3f6a6bb/57144bd94bd54d2d8b5766ffb3ef194a [2019-09-07 13:20:14,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:20:14,858 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:20:14,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:20:14,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:20:14,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:20:14,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:20:14" (1/1) ... [2019-09-07 13:20:14,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60889099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:20:14, skipping insertion in model container [2019-09-07 13:20:14,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:20:14" (1/1) ... [2019-09-07 13:20:14,873 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:20:14,959 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:20:15,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:20:15,830 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:20:16,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:20:16,238 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:20:16,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:20:16 WrapperNode [2019-09-07 13:20:16,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:20:16,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:20:16,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:20:16,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:20:16,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:20:16" (1/1) ... [2019-09-07 13:20:16,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:20:16" (1/1) ... [2019-09-07 13:20:16,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:20:16" (1/1) ... [2019-09-07 13:20:16,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:20:16" (1/1) ... [2019-09-07 13:20:16,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:20:16" (1/1) ... [2019-09-07 13:20:16,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:20:16" (1/1) ... [2019-09-07 13:20:16,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:20:16" (1/1) ... [2019-09-07 13:20:16,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:20:16,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:20:16,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:20:16,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:20:16,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:20:16" (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 13:20:16,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:20:16,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:20:16,507 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 13:20:16,507 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:20:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 13:20:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:20:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:20:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 13:20:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:20:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:20:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:20:18,433 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:20:18,434 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:20:18,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:20:18 BoogieIcfgContainer [2019-09-07 13:20:18,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:20:18,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:20:18,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:20:18,442 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:20:18,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:20:14" (1/3) ... [2019-09-07 13:20:18,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4377c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:20:18, skipping insertion in model container [2019-09-07 13:20:18,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:20:16" (2/3) ... [2019-09-07 13:20:18,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4377c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:20:18, skipping insertion in model container [2019-09-07 13:20:18,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:20:18" (3/3) ... [2019-09-07 13:20:18,450 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label20.c [2019-09-07 13:20:18,464 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:20:18,476 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:20:18,495 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:20:18,543 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:20:18,544 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:20:18,545 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:20:18,545 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:20:18,546 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:20:18,546 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:20:18,546 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:20:18,546 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:20:18,546 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:20:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states. [2019-09-07 13:20:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-07 13:20:18,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:20:18,616 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:20:18,618 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:20:18,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:20:18,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1111683352, now seen corresponding path program 1 times [2019-09-07 13:20:18,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:20:18,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:20:18,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:18,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:20:18,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:19,524 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 13:20:19,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:20:19,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:20:19,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:20:19,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:20:19,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:20:19,548 INFO L87 Difference]: Start difference. First operand 311 states. Second operand 3 states. [2019-09-07 13:20:20,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:20:20,795 INFO L93 Difference]: Finished difference Result 835 states and 1476 transitions. [2019-09-07 13:20:20,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:20:20,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-09-07 13:20:20,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:20:20,817 INFO L225 Difference]: With dead ends: 835 [2019-09-07 13:20:20,818 INFO L226 Difference]: Without dead ends: 462 [2019-09-07 13:20:20,825 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 13:20:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-07 13:20:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2019-09-07 13:20:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-07 13:20:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 739 transitions. [2019-09-07 13:20:20,909 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 739 transitions. Word has length 201 [2019-09-07 13:20:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:20:20,910 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 739 transitions. [2019-09-07 13:20:20,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:20:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 739 transitions. [2019-09-07 13:20:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-07 13:20:20,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:20:20,915 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 13:20:20,916 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:20:20,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:20:20,916 INFO L82 PathProgramCache]: Analyzing trace with hash -804212693, now seen corresponding path program 1 times [2019-09-07 13:20:20,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:20:20,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:20:20,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:20,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:20:20,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:20:21,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:20:21,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:20:21,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:20:21,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:20:21,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:20:21,154 INFO L87 Difference]: Start difference. First operand 460 states and 739 transitions. Second operand 6 states. [2019-09-07 13:20:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:20:22,956 INFO L93 Difference]: Finished difference Result 1391 states and 2302 transitions. [2019-09-07 13:20:22,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:20:22,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-07 13:20:22,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:20:22,968 INFO L225 Difference]: With dead ends: 1391 [2019-09-07 13:20:22,968 INFO L226 Difference]: Without dead ends: 937 [2019-09-07 13:20:22,971 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 13:20:22,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-09-07 13:20:23,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 899. [2019-09-07 13:20:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-09-07 13:20:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1431 transitions. [2019-09-07 13:20:23,039 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1431 transitions. Word has length 210 [2019-09-07 13:20:23,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:20:23,039 INFO L475 AbstractCegarLoop]: Abstraction has 899 states and 1431 transitions. [2019-09-07 13:20:23,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:20:23,040 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1431 transitions. [2019-09-07 13:20:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-07 13:20:23,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:20:23,045 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 13:20:23,046 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:20:23,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:20:23,046 INFO L82 PathProgramCache]: Analyzing trace with hash -604412164, now seen corresponding path program 1 times [2019-09-07 13:20:23,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:20:23,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:20:23,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:23,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:20:23,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:20:23,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:20:23,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:20:23,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:20:23,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:20:23,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:20:23,369 INFO L87 Difference]: Start difference. First operand 899 states and 1431 transitions. Second operand 3 states. [2019-09-07 13:20:24,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:20:24,606 INFO L93 Difference]: Finished difference Result 2651 states and 4310 transitions. [2019-09-07 13:20:24,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:20:24,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-09-07 13:20:24,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:20:24,620 INFO L225 Difference]: With dead ends: 2651 [2019-09-07 13:20:24,621 INFO L226 Difference]: Without dead ends: 1758 [2019-09-07 13:20:24,624 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 13:20:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2019-09-07 13:20:24,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1738. [2019-09-07 13:20:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-07 13:20:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2738 transitions. [2019-09-07 13:20:24,688 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2738 transitions. Word has length 213 [2019-09-07 13:20:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:20:24,689 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2738 transitions. [2019-09-07 13:20:24,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:20:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2738 transitions. [2019-09-07 13:20:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-07 13:20:24,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:20:24,698 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 13:20:24,698 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:20:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:20:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash 600022311, now seen corresponding path program 1 times [2019-09-07 13:20:24,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:20:24,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:20:24,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:24,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:20:24,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:20:24,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:20:24,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 13:20:24,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:20:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:25,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:20:25,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:20:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 13:20:25,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:20:25,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 13:20:25,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:20:25,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:20:25,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:20:25,396 INFO L87 Difference]: Start difference. First operand 1738 states and 2738 transitions. Second operand 7 states. [2019-09-07 13:20:27,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:20:27,086 INFO L93 Difference]: Finished difference Result 5109 states and 8301 transitions. [2019-09-07 13:20:27,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:20:27,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 230 [2019-09-07 13:20:27,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:20:27,113 INFO L225 Difference]: With dead ends: 5109 [2019-09-07 13:20:27,113 INFO L226 Difference]: Without dead ends: 3377 [2019-09-07 13:20:27,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:20:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3377 states. [2019-09-07 13:20:27,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3377 to 3375. [2019-09-07 13:20:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3375 states. [2019-09-07 13:20:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3375 states to 3375 states and 5050 transitions. [2019-09-07 13:20:27,311 INFO L78 Accepts]: Start accepts. Automaton has 3375 states and 5050 transitions. Word has length 230 [2019-09-07 13:20:27,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:20:27,312 INFO L475 AbstractCegarLoop]: Abstraction has 3375 states and 5050 transitions. [2019-09-07 13:20:27,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:20:27,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3375 states and 5050 transitions. [2019-09-07 13:20:27,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-07 13:20:27,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:20:27,325 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:20:27,326 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:20:27,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:20:27,326 INFO L82 PathProgramCache]: Analyzing trace with hash -562768747, now seen corresponding path program 1 times [2019-09-07 13:20:27,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:20:27,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:20:27,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:27,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:20:27,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:20:27,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:20:27,587 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 13:20:27,606 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 13:20:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:27,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:20:27,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:20:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:20:27,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:20:27,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 13:20:27,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:20:27,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:20:27,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:20:27,973 INFO L87 Difference]: Start difference. First operand 3375 states and 5050 transitions. Second operand 9 states. [2019-09-07 13:20:35,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:20:35,525 INFO L93 Difference]: Finished difference Result 14441 states and 32244 transitions. [2019-09-07 13:20:35,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 13:20:35,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 278 [2019-09-07 13:20:35,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:20:35,698 INFO L225 Difference]: With dead ends: 14441 [2019-09-07 13:20:35,698 INFO L226 Difference]: Without dead ends: 11072 [2019-09-07 13:20:35,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=455, Invalid=2095, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 13:20:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11072 states. [2019-09-07 13:20:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11072 to 10086. [2019-09-07 13:20:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10086 states. [2019-09-07 13:20:36,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10086 states to 10086 states and 13438 transitions. [2019-09-07 13:20:36,462 INFO L78 Accepts]: Start accepts. Automaton has 10086 states and 13438 transitions. Word has length 278 [2019-09-07 13:20:36,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:20:36,462 INFO L475 AbstractCegarLoop]: Abstraction has 10086 states and 13438 transitions. [2019-09-07 13:20:36,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:20:36,463 INFO L276 IsEmpty]: Start isEmpty. Operand 10086 states and 13438 transitions. [2019-09-07 13:20:36,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-09-07 13:20:36,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:20:36,511 INFO L399 BasicCegarLoop]: trace histogram [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, 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] [2019-09-07 13:20:36,511 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:20:36,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:20:36,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1617879534, now seen corresponding path program 1 times [2019-09-07 13:20:36,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:20:36,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:20:36,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:36,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:20:36,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 89 proven. 34 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 13:20:36,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:20:36,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 13:20:36,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:20:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:37,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 13:20:37,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:20:37,226 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-07 13:20:37,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:20:37,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 13:20:37,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:20:37,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:20:37,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:20:37,242 INFO L87 Difference]: Start difference. First operand 10086 states and 13438 transitions. Second operand 9 states. [2019-09-07 13:20:44,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:20:44,619 INFO L93 Difference]: Finished difference Result 48205 states and 80656 transitions. [2019-09-07 13:20:44,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 13:20:44,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 285 [2019-09-07 13:20:44,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:20:44,838 INFO L225 Difference]: With dead ends: 48205 [2019-09-07 13:20:44,839 INFO L226 Difference]: Without dead ends: 38125 [2019-09-07 13:20:44,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=1287, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 13:20:44,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38125 states. [2019-09-07 13:20:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38125 to 36578. [2019-09-07 13:20:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36578 states. [2019-09-07 13:20:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36578 states to 36578 states and 48355 transitions. [2019-09-07 13:20:46,351 INFO L78 Accepts]: Start accepts. Automaton has 36578 states and 48355 transitions. Word has length 285 [2019-09-07 13:20:46,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:20:46,352 INFO L475 AbstractCegarLoop]: Abstraction has 36578 states and 48355 transitions. [2019-09-07 13:20:46,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:20:46,361 INFO L276 IsEmpty]: Start isEmpty. Operand 36578 states and 48355 transitions. [2019-09-07 13:20:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-07 13:20:46,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:20:46,503 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-09-07 13:20:46,504 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:20:46,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:20:46,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2057038945, now seen corresponding path program 1 times [2019-09-07 13:20:46,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:20:46,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:20:46,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:46,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:20:46,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 97 proven. 90 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 13:20:47,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:20:47,013 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:20:47,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:20:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:47,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 13:20:47,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:20:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 97 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-07 13:20:47,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:20:47,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-07 13:20:47,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 13:20:47,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 13:20:47,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-09-07 13:20:47,366 INFO L87 Difference]: Start difference. First operand 36578 states and 48355 transitions. Second operand 13 states. [2019-09-07 13:20:54,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:20:54,511 INFO L93 Difference]: Finished difference Result 120417 states and 163796 transitions. [2019-09-07 13:20:54,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 13:20:54,512 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 305 [2019-09-07 13:20:54,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:20:54,865 INFO L225 Difference]: With dead ends: 120417 [2019-09-07 13:20:54,866 INFO L226 Difference]: Without dead ends: 83865 [2019-09-07 13:20:54,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 13:20:55,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83865 states. [2019-09-07 13:20:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83865 to 83374. [2019-09-07 13:20:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83374 states. [2019-09-07 13:20:58,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83374 states to 83374 states and 109888 transitions. [2019-09-07 13:20:58,725 INFO L78 Accepts]: Start accepts. Automaton has 83374 states and 109888 transitions. Word has length 305 [2019-09-07 13:20:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:20:58,725 INFO L475 AbstractCegarLoop]: Abstraction has 83374 states and 109888 transitions. [2019-09-07 13:20:58,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 13:20:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 83374 states and 109888 transitions. [2019-09-07 13:20:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-07 13:20:58,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:20:58,949 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:20:58,949 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:20:58,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:20:58,950 INFO L82 PathProgramCache]: Analyzing trace with hash -616143672, now seen corresponding path program 1 times [2019-09-07 13:20:58,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:20:58,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:20:58,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:58,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:20:58,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:20:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 127 proven. 34 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-07 13:20:59,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:20:59,248 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 13:20:59,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:20:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:20:59,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 13:20:59,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:20:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 146 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-07 13:20:59,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:20:59,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-09-07 13:20:59,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 13:20:59,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 13:20:59,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-07 13:20:59,642 INFO L87 Difference]: Start difference. First operand 83374 states and 109888 transitions. Second operand 12 states. [2019-09-07 13:21:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:21:16,701 INFO L93 Difference]: Finished difference Result 229710 states and 344637 transitions. [2019-09-07 13:21:16,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-07 13:21:16,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 314 [2019-09-07 13:21:16,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:21:17,565 INFO L225 Difference]: With dead ends: 229710 [2019-09-07 13:21:17,565 INFO L226 Difference]: Without dead ends: 146404 [2019-09-07 13:21:17,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3324 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1228, Invalid=7328, Unknown=0, NotChecked=0, Total=8556 [2019-09-07 13:21:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146404 states. [2019-09-07 13:21:23,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146404 to 131604. [2019-09-07 13:21:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131604 states. [2019-09-07 13:21:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131604 states to 131604 states and 171097 transitions. [2019-09-07 13:21:23,511 INFO L78 Accepts]: Start accepts. Automaton has 131604 states and 171097 transitions. Word has length 314 [2019-09-07 13:21:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:21:23,512 INFO L475 AbstractCegarLoop]: Abstraction has 131604 states and 171097 transitions. [2019-09-07 13:21:23,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 13:21:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 131604 states and 171097 transitions. [2019-09-07 13:21:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-07 13:21:23,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:21:23,796 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 13:21:23,797 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:21:23,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:21:23,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1588823557, now seen corresponding path program 1 times [2019-09-07 13:21:23,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:21:23,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:21:23,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:23,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:23,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 114 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 13:21:24,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:21:24,106 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 13:21:24,136 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 13:21:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:24,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 13:21:24,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:21:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-07 13:21:24,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:21:24,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 13:21:24,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:21:24,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:21:24,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:21:24,568 INFO L87 Difference]: Start difference. First operand 131604 states and 171097 transitions. Second operand 9 states. [2019-09-07 13:21:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:21:29,701 INFO L93 Difference]: Finished difference Result 262297 states and 343670 transitions. [2019-09-07 13:21:29,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:21:29,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 321 [2019-09-07 13:21:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:21:30,263 INFO L225 Difference]: With dead ends: 262297 [2019-09-07 13:21:30,263 INFO L226 Difference]: Without dead ends: 131416 [2019-09-07 13:21:30,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-09-07 13:21:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131416 states. [2019-09-07 13:21:32,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131416 to 129294. [2019-09-07 13:21:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129294 states. [2019-09-07 13:21:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129294 states to 129294 states and 160309 transitions. [2019-09-07 13:21:33,117 INFO L78 Accepts]: Start accepts. Automaton has 129294 states and 160309 transitions. Word has length 321 [2019-09-07 13:21:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:21:33,118 INFO L475 AbstractCegarLoop]: Abstraction has 129294 states and 160309 transitions. [2019-09-07 13:21:33,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:21:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 129294 states and 160309 transitions. [2019-09-07 13:21:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-07 13:21:33,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:21:33,236 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 13:21:33,237 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:21:33,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:21:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2131293155, now seen corresponding path program 1 times [2019-09-07 13:21:33,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:21:33,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:21:33,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:33,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:33,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 183 proven. 70 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-07 13:21:33,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:21:33,657 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 13:21:33,672 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 13:21:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:33,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 13:21:33,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:21:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 221 proven. 2 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-07 13:21:34,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:21:34,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-07 13:21:34,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 13:21:34,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 13:21:34,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:21:34,034 INFO L87 Difference]: Start difference. First operand 129294 states and 160309 transitions. Second operand 10 states. [2019-09-07 13:21:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:21:41,229 INFO L93 Difference]: Finished difference Result 227517 states and 291264 transitions. [2019-09-07 13:21:41,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 13:21:41,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 371 [2019-09-07 13:21:41,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:21:41,461 INFO L225 Difference]: With dead ends: 227517 [2019-09-07 13:21:41,461 INFO L226 Difference]: Without dead ends: 88235 [2019-09-07 13:21:41,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2019-09-07 13:21:41,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88235 states. [2019-09-07 13:21:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88235 to 67615. [2019-09-07 13:21:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67615 states. [2019-09-07 13:21:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67615 states to 67615 states and 76288 transitions. [2019-09-07 13:21:43,318 INFO L78 Accepts]: Start accepts. Automaton has 67615 states and 76288 transitions. Word has length 371 [2019-09-07 13:21:43,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:21:43,318 INFO L475 AbstractCegarLoop]: Abstraction has 67615 states and 76288 transitions. [2019-09-07 13:21:43,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 13:21:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 67615 states and 76288 transitions. [2019-09-07 13:21:43,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-07 13:21:43,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:21:43,376 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:21:43,377 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:21:43,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:21:43,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1215181484, now seen corresponding path program 1 times [2019-09-07 13:21:43,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:21:43,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:21:43,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:43,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:43,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 231 proven. 34 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-07 13:21:43,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:21:43,772 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 13:21:43,799 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 13:21:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:44,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 1360 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 13:21:44,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:21:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 263 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-07 13:21:44,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:21:44,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-09-07 13:21:44,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:21:44,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:21:44,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:21:44,189 INFO L87 Difference]: Start difference. First operand 67615 states and 76288 transitions. Second operand 6 states. [2019-09-07 13:21:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:21:45,965 INFO L93 Difference]: Finished difference Result 184634 states and 217719 transitions. [2019-09-07 13:21:45,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:21:45,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 403 [2019-09-07 13:21:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:21:46,320 INFO L225 Difference]: With dead ends: 184634 [2019-09-07 13:21:46,320 INFO L226 Difference]: Without dead ends: 122735 [2019-09-07 13:21:46,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:21:46,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122735 states. [2019-09-07 13:21:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122735 to 117798. [2019-09-07 13:21:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117798 states. [2019-09-07 13:21:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117798 states to 117798 states and 134006 transitions. [2019-09-07 13:21:50,382 INFO L78 Accepts]: Start accepts. Automaton has 117798 states and 134006 transitions. Word has length 403 [2019-09-07 13:21:50,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:21:50,382 INFO L475 AbstractCegarLoop]: Abstraction has 117798 states and 134006 transitions. [2019-09-07 13:21:50,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:21:50,383 INFO L276 IsEmpty]: Start isEmpty. Operand 117798 states and 134006 transitions. [2019-09-07 13:21:50,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-09-07 13:21:50,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:21:50,509 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:21:50,509 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:21:50,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:21:50,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1896838632, now seen corresponding path program 1 times [2019-09-07 13:21:50,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:21:50,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:21:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:50,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 278 proven. 70 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 13:21:51,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:21:51,109 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 13:21:51,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:51,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 1697 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 13:21:51,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:21:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 423 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 13:21:52,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:21:52,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 13:21:52,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 13:21:52,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 13:21:52,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-07 13:21:52,173 INFO L87 Difference]: Start difference. First operand 117798 states and 134006 transitions. Second operand 13 states. [2019-09-07 13:22:05,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:22:05,422 INFO L93 Difference]: Finished difference Result 234268 states and 289655 transitions. [2019-09-07 13:22:05,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 13:22:05,422 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 431 [2019-09-07 13:22:05,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:22:05,974 INFO L225 Difference]: With dead ends: 234268 [2019-09-07 13:22:05,974 INFO L226 Difference]: Without dead ends: 132543 [2019-09-07 13:22:06,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=854, Invalid=3838, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 13:22:06,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132543 states. [2019-09-07 13:22:08,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132543 to 121467. [2019-09-07 13:22:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121467 states. [2019-09-07 13:22:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121467 states to 121467 states and 137562 transitions. [2019-09-07 13:22:08,937 INFO L78 Accepts]: Start accepts. Automaton has 121467 states and 137562 transitions. Word has length 431 [2019-09-07 13:22:08,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:22:08,937 INFO L475 AbstractCegarLoop]: Abstraction has 121467 states and 137562 transitions. [2019-09-07 13:22:08,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 13:22:08,937 INFO L276 IsEmpty]: Start isEmpty. Operand 121467 states and 137562 transitions. [2019-09-07 13:22:09,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-09-07 13:22:09,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:22:09,086 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-09-07 13:22:09,086 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:22:09,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:22:09,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1048585061, now seen corresponding path program 1 times [2019-09-07 13:22:09,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:22:09,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:22:09,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:22:09,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:22:09,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:22:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:22:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 244 proven. 20 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-07 13:22:09,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:22:09,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 13:22:09,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:22:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:22:09,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 1724 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 13:22:09,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:22:09,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:22:09,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:22:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-09-07 13:22:09,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:22:09,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-07 13:22:09,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:22:09,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:22:09,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:22:09,813 INFO L87 Difference]: Start difference. First operand 121467 states and 137562 transitions. Second operand 9 states. [2019-09-07 13:22:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:22:21,279 INFO L93 Difference]: Finished difference Result 395751 states and 477717 transitions. [2019-09-07 13:22:21,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-07 13:22:21,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 446 [2019-09-07 13:22:21,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:22:22,118 INFO L225 Difference]: With dead ends: 395751 [2019-09-07 13:22:22,118 INFO L226 Difference]: Without dead ends: 290729 [2019-09-07 13:22:22,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=536, Invalid=2544, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 13:22:22,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290729 states. [2019-09-07 13:22:31,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290729 to 280047. [2019-09-07 13:22:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280047 states. [2019-09-07 13:22:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280047 states to 280047 states and 319707 transitions. [2019-09-07 13:22:31,696 INFO L78 Accepts]: Start accepts. Automaton has 280047 states and 319707 transitions. Word has length 446 [2019-09-07 13:22:31,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:22:31,697 INFO L475 AbstractCegarLoop]: Abstraction has 280047 states and 319707 transitions. [2019-09-07 13:22:31,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:22:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 280047 states and 319707 transitions. [2019-09-07 13:22:32,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-09-07 13:22:32,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:22:32,049 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-09-07 13:22:32,049 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:22:32,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:22:32,050 INFO L82 PathProgramCache]: Analyzing trace with hash 501674152, now seen corresponding path program 1 times [2019-09-07 13:22:32,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:22:32,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:22:32,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:22:32,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:22:32,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:22:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:22:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 230 proven. 143 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-09-07 13:22:33,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:22:33,233 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 13:22:33,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:22:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:22:33,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 1720 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 13:22:33,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:22:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-09-07 13:22:33,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:22:33,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 13:22:33,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:22:33,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:22:33,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:22:33,674 INFO L87 Difference]: Start difference. First operand 280047 states and 319707 transitions. Second operand 9 states. [2019-09-07 13:22:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:22:43,791 INFO L93 Difference]: Finished difference Result 552073 states and 630301 transitions. [2019-09-07 13:22:43,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 13:22:43,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 448 [2019-09-07 13:22:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:22:44,691 INFO L225 Difference]: With dead ends: 552073 [2019-09-07 13:22:44,691 INFO L226 Difference]: Without dead ends: 282863 [2019-09-07 13:22:45,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 454 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-09-07 13:22:45,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282863 states. [2019-09-07 13:22:50,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282863 to 280979. [2019-09-07 13:22:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280979 states. [2019-09-07 13:22:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280979 states to 280979 states and 320271 transitions. [2019-09-07 13:22:50,691 INFO L78 Accepts]: Start accepts. Automaton has 280979 states and 320271 transitions. Word has length 448 [2019-09-07 13:22:50,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:22:50,691 INFO L475 AbstractCegarLoop]: Abstraction has 280979 states and 320271 transitions. [2019-09-07 13:22:50,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:22:50,691 INFO L276 IsEmpty]: Start isEmpty. Operand 280979 states and 320271 transitions. [2019-09-07 13:22:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2019-09-07 13:22:51,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:22:51,043 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:22:51,043 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:22:51,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:22:51,043 INFO L82 PathProgramCache]: Analyzing trace with hash -264208638, now seen corresponding path program 1 times [2019-09-07 13:22:51,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:22:51,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:22:51,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:22:51,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:22:51,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:22:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:22:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 372 proven. 104 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-07 13:22:51,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:22:51,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:22:51,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:22:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:22:51,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:22:51,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:22:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 391 proven. 2 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-07 13:22:55,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:22:55,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-07 13:22:55,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 13:22:55,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 13:22:55,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-07 13:22:55,887 INFO L87 Difference]: Start difference. First operand 280979 states and 320271 transitions. Second operand 13 states. [2019-09-07 13:23:16,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:23:16,394 INFO L93 Difference]: Finished difference Result 817047 states and 988651 transitions. [2019-09-07 13:23:16,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 13:23:16,395 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 457 [2019-09-07 13:23:16,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:23:18,354 INFO L225 Difference]: With dead ends: 817047 [2019-09-07 13:23:18,354 INFO L226 Difference]: Without dead ends: 550513 [2019-09-07 13:23:18,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=594, Invalid=2712, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 13:23:19,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550513 states. [2019-09-07 13:23:37,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550513 to 527246. [2019-09-07 13:23:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527246 states. [2019-09-07 13:23:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527246 states to 527246 states and 625556 transitions. [2019-09-07 13:23:49,071 INFO L78 Accepts]: Start accepts. Automaton has 527246 states and 625556 transitions. Word has length 457 [2019-09-07 13:23:49,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:23:49,072 INFO L475 AbstractCegarLoop]: Abstraction has 527246 states and 625556 transitions. [2019-09-07 13:23:49,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 13:23:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 527246 states and 625556 transitions. [2019-09-07 13:23:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-09-07 13:23:50,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:23:50,075 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 13:23:50,075 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:23:50,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:23:50,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1551534224, now seen corresponding path program 1 times [2019-09-07 13:23:50,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:23:50,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:23:50,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:23:50,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:23:50,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:23:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:23:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 325 proven. 133 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-09-07 13:23:50,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:23:50,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:23:50,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:23:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:23:50,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 1906 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 13:23:50,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:23:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 568 proven. 4 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-07 13:23:52,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:23:52,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 13:23:52,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 13:23:52,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 13:23:52,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:23:52,245 INFO L87 Difference]: Start difference. First operand 527246 states and 625556 transitions. Second operand 10 states. [2019-09-07 13:25:00,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:25:00,260 INFO L93 Difference]: Finished difference Result 1986541 states and 2556989 transitions. [2019-09-07 13:25:00,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 13:25:00,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 473 [2019-09-07 13:25:00,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:25:09,132 INFO L225 Difference]: With dead ends: 1986541 [2019-09-07 13:25:09,132 INFO L226 Difference]: Without dead ends: 1446744 [2019-09-07 13:25:11,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=316, Invalid=1090, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 13:25:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446744 states. [2019-09-07 13:26:43,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446744 to 1318233. [2019-09-07 13:26:43,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318233 states.