java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label40.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:47:23,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:47:23,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:47:23,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:47:23,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:47:23,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:47:23,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:47:23,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:47:23,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:47:23,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:47:23,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:47:23,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:47:23,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:47:23,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:47:23,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:47:23,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:47:23,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:47:23,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:47:23,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:47:23,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:47:23,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:47:23,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:47:23,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:47:23,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:47:23,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:47:23,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:47:23,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:47:23,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:47:23,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:47:23,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:47:23,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:47:23,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:47:23,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:47:23,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:47:23,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:47:23,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:47:23,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:47:23,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:47:23,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:47:23,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:47:23,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:47:23,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 19:47:23,954 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:47:23,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:47:23,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:47:23,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:47:23,956 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:47:23,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:47:23,956 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:47:23,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:47:23,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:47:23,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:47:23,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:47:23,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:47:23,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:47:23,958 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:47:23,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:47:23,958 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:47:23,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:47:23,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:47:23,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:47:23,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:47:23,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:47:23,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:47:23,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:47:23,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:47:23,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:47:23,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:47:23,960 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:47:23,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:47:23,961 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:47:24,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:47:24,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:47:24,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:47:24,018 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:47:24,018 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:47:24,019 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label40.c [2019-09-07 19:47:24,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11290cb24/cdaab5daa000498486587175fd4d4465/FLAG6592d9268 [2019-09-07 19:47:24,894 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:47:24,895 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label40.c [2019-09-07 19:47:24,932 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11290cb24/cdaab5daa000498486587175fd4d4465/FLAG6592d9268 [2019-09-07 19:47:25,417 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11290cb24/cdaab5daa000498486587175fd4d4465 [2019-09-07 19:47:25,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:47:25,432 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:47:25,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:47:25,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:47:25,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:47:25,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:47:25" (1/1) ... [2019-09-07 19:47:25,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbe1c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:47:25, skipping insertion in model container [2019-09-07 19:47:25,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:47:25" (1/1) ... [2019-09-07 19:47:25,452 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:47:25,604 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:47:26,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:47:26,970 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:47:27,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:47:27,662 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:47:27,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:47:27 WrapperNode [2019-09-07 19:47:27,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:47:27,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:47:27,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:47:27,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:47:27,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:47:27" (1/1) ... [2019-09-07 19:47:27,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:47:27" (1/1) ... [2019-09-07 19:47:27,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:47:27" (1/1) ... [2019-09-07 19:47:27,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:47:27" (1/1) ... [2019-09-07 19:47:27,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:47:27" (1/1) ... [2019-09-07 19:47:27,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:47:27" (1/1) ... [2019-09-07 19:47:27,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:47:27" (1/1) ... [2019-09-07 19:47:28,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:47:28,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:47:28,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:47:28,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:47:28,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:47:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:47:28,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:47:28,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:47:28,095 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:47:28,095 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:47:28,095 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:47:28,095 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:47:28,096 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:47:28,096 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:47:28,096 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:47:28,096 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:47:28,096 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:47:28,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:47:28,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:47:28,098 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:47:28,098 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:47:28,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:47:28,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:47:34,618 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:47:34,618 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:47:34,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:47:34 BoogieIcfgContainer [2019-09-07 19:47:34,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:47:34,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:47:34,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:47:34,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:47:34,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:47:25" (1/3) ... [2019-09-07 19:47:34,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473ed373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:47:34, skipping insertion in model container [2019-09-07 19:47:34,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:47:27" (2/3) ... [2019-09-07 19:47:34,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473ed373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:47:34, skipping insertion in model container [2019-09-07 19:47:34,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:47:34" (3/3) ... [2019-09-07 19:47:34,642 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label40.c [2019-09-07 19:47:34,654 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:47:34,665 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:47:34,683 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:47:34,736 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:47:34,736 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:47:34,737 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:47:34,737 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:47:34,737 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:47:34,737 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:47:34,737 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:47:34,737 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:47:34,737 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:47:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:47:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 19:47:34,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:47:34,786 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] [2019-09-07 19:47:34,788 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:47:34,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:47:34,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1856929193, now seen corresponding path program 1 times [2019-09-07 19:47:34,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:47:34,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:47:34,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:34,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:47:34,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:47:35,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:47:35,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:47:35,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:47:35,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:47:35,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:47:35,069 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 19:47:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:47:40,586 INFO L93 Difference]: Finished difference Result 3094 states and 5704 transitions. [2019-09-07 19:47:40,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:47:40,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-07 19:47:40,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:47:40,632 INFO L225 Difference]: With dead ends: 3094 [2019-09-07 19:47:40,632 INFO L226 Difference]: Without dead ends: 1913 [2019-09-07 19:47:40,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:47:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2019-09-07 19:47:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1912. [2019-09-07 19:47:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2019-09-07 19:47:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 3141 transitions. [2019-09-07 19:47:40,819 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 3141 transitions. Word has length 34 [2019-09-07 19:47:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:47:40,821 INFO L475 AbstractCegarLoop]: Abstraction has 1912 states and 3141 transitions. [2019-09-07 19:47:40,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:47:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 3141 transitions. [2019-09-07 19:47:40,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-07 19:47:40,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:47:40,831 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:47:40,832 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:47:40,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:47:40,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1973461197, now seen corresponding path program 1 times [2019-09-07 19:47:40,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:47:40,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:47:40,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:40,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:47:40,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:47:41,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:47:41,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:47:41,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:47:41,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:47:41,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:47:41,183 INFO L87 Difference]: Start difference. First operand 1912 states and 3141 transitions. Second operand 5 states. [2019-09-07 19:47:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:47:50,848 INFO L93 Difference]: Finished difference Result 5589 states and 9299 transitions. [2019-09-07 19:47:50,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:47:50,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-07 19:47:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:47:50,872 INFO L225 Difference]: With dead ends: 5589 [2019-09-07 19:47:50,872 INFO L226 Difference]: Without dead ends: 3683 [2019-09-07 19:47:50,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:47:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2019-09-07 19:47:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 3601. [2019-09-07 19:47:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3601 states. [2019-09-07 19:47:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3601 states and 5413 transitions. [2019-09-07 19:47:51,011 INFO L78 Accepts]: Start accepts. Automaton has 3601 states and 5413 transitions. Word has length 109 [2019-09-07 19:47:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:47:51,012 INFO L475 AbstractCegarLoop]: Abstraction has 3601 states and 5413 transitions. [2019-09-07 19:47:51,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:47:51,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3601 states and 5413 transitions. [2019-09-07 19:47:51,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-07 19:47:51,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:47:51,023 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:47:51,023 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:47:51,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:47:51,024 INFO L82 PathProgramCache]: Analyzing trace with hash -276532905, now seen corresponding path program 1 times [2019-09-07 19:47:51,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:47:51,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:47:51,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:51,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:47:51,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:47:51,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:47:51,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:47:51,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:47:51,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:47:51,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:47:51,306 INFO L87 Difference]: Start difference. First operand 3601 states and 5413 transitions. Second operand 5 states. [2019-09-07 19:48:02,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:48:02,912 INFO L93 Difference]: Finished difference Result 10903 states and 16895 transitions. [2019-09-07 19:48:02,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:48:02,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-09-07 19:48:02,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:48:02,958 INFO L225 Difference]: With dead ends: 10903 [2019-09-07 19:48:02,959 INFO L226 Difference]: Without dead ends: 7308 [2019-09-07 19:48:02,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:48:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7308 states. [2019-09-07 19:48:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7308 to 7121. [2019-09-07 19:48:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7121 states. [2019-09-07 19:48:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7121 states to 7121 states and 10497 transitions. [2019-09-07 19:48:03,189 INFO L78 Accepts]: Start accepts. Automaton has 7121 states and 10497 transitions. Word has length 123 [2019-09-07 19:48:03,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:48:03,190 INFO L475 AbstractCegarLoop]: Abstraction has 7121 states and 10497 transitions. [2019-09-07 19:48:03,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:48:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 7121 states and 10497 transitions. [2019-09-07 19:48:03,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-07 19:48:03,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:48:03,192 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:48:03,193 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:48:03,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:48:03,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1903087117, now seen corresponding path program 1 times [2019-09-07 19:48:03,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:48:03,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:48:03,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:03,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:48:03,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:48:03,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:48:03,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:48:03,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:48:03,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:48:03,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:48:03,412 INFO L87 Difference]: Start difference. First operand 7121 states and 10497 transitions. Second operand 6 states. [2019-09-07 19:48:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:48:11,674 INFO L93 Difference]: Finished difference Result 21450 states and 33775 transitions. [2019-09-07 19:48:11,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:48:11,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-07 19:48:11,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:48:11,755 INFO L225 Difference]: With dead ends: 21450 [2019-09-07 19:48:11,756 INFO L226 Difference]: Without dead ends: 14335 [2019-09-07 19:48:11,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:48:11,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14335 states. [2019-09-07 19:48:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14335 to 14126. [2019-09-07 19:48:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14126 states. [2019-09-07 19:48:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14126 states to 14126 states and 21305 transitions. [2019-09-07 19:48:12,171 INFO L78 Accepts]: Start accepts. Automaton has 14126 states and 21305 transitions. Word has length 141 [2019-09-07 19:48:12,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:48:12,173 INFO L475 AbstractCegarLoop]: Abstraction has 14126 states and 21305 transitions. [2019-09-07 19:48:12,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:48:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand 14126 states and 21305 transitions. [2019-09-07 19:48:12,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-07 19:48:12,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:48:12,176 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:48:12,176 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:48:12,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:48:12,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2135423331, now seen corresponding path program 1 times [2019-09-07 19:48:12,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:48:12,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:48:12,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:12,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:48:12,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:48:12,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:48:12,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:48:12,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:48:12,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:48:12,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:48:12,307 INFO L87 Difference]: Start difference. First operand 14126 states and 21305 transitions. Second operand 4 states. [2019-09-07 19:48:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:48:22,076 INFO L93 Difference]: Finished difference Result 39802 states and 60421 transitions. [2019-09-07 19:48:22,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:48:22,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-07 19:48:22,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:48:22,187 INFO L225 Difference]: With dead ends: 39802 [2019-09-07 19:48:22,187 INFO L226 Difference]: Without dead ends: 25682 [2019-09-07 19:48:22,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:48:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25682 states. [2019-09-07 19:48:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25682 to 24753. [2019-09-07 19:48:22,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24753 states. [2019-09-07 19:48:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24753 states to 24753 states and 35822 transitions. [2019-09-07 19:48:22,798 INFO L78 Accepts]: Start accepts. Automaton has 24753 states and 35822 transitions. Word has length 149 [2019-09-07 19:48:22,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:48:22,798 INFO L475 AbstractCegarLoop]: Abstraction has 24753 states and 35822 transitions. [2019-09-07 19:48:22,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:48:22,798 INFO L276 IsEmpty]: Start isEmpty. Operand 24753 states and 35822 transitions. [2019-09-07 19:48:22,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-07 19:48:22,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:48:22,801 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:48:22,802 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:48:22,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:48:22,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1768094604, now seen corresponding path program 1 times [2019-09-07 19:48:22,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:48:22,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:48:22,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:22,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:48:22,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:48:23,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:48:23,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:48:23,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:48:23,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:48:23,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:48:23,075 INFO L87 Difference]: Start difference. First operand 24753 states and 35822 transitions. Second operand 6 states. [2019-09-07 19:48:30,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:48:30,754 INFO L93 Difference]: Finished difference Result 69125 states and 108458 transitions. [2019-09-07 19:48:30,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:48:30,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-09-07 19:48:30,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:48:30,916 INFO L225 Difference]: With dead ends: 69125 [2019-09-07 19:48:30,916 INFO L226 Difference]: Without dead ends: 44378 [2019-09-07 19:48:30,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:48:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44378 states. [2019-09-07 19:48:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44378 to 44219. [2019-09-07 19:48:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44219 states. [2019-09-07 19:48:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44219 states to 44219 states and 63019 transitions. [2019-09-07 19:48:32,115 INFO L78 Accepts]: Start accepts. Automaton has 44219 states and 63019 transitions. Word has length 152 [2019-09-07 19:48:32,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:48:32,116 INFO L475 AbstractCegarLoop]: Abstraction has 44219 states and 63019 transitions. [2019-09-07 19:48:32,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:48:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 44219 states and 63019 transitions. [2019-09-07 19:48:32,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-07 19:48:32,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:48:32,119 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:48:32,120 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:48:32,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:48:32,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1419208357, now seen corresponding path program 1 times [2019-09-07 19:48:32,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:48:32,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:48:32,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:32,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:48:32,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:32,282 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:48:32,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:48:32,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:48:32,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:48:32,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:48:32,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:48:32,284 INFO L87 Difference]: Start difference. First operand 44219 states and 63019 transitions. Second operand 6 states. [2019-09-07 19:48:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:48:40,418 INFO L93 Difference]: Finished difference Result 96594 states and 139785 transitions. [2019-09-07 19:48:40,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:48:40,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-07 19:48:40,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:48:40,607 INFO L225 Difference]: With dead ends: 96594 [2019-09-07 19:48:40,608 INFO L226 Difference]: Without dead ends: 52381 [2019-09-07 19:48:40,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:48:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52381 states. [2019-09-07 19:48:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52381 to 49876. [2019-09-07 19:48:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49876 states. [2019-09-07 19:48:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49876 states to 49876 states and 67866 transitions. [2019-09-07 19:48:41,735 INFO L78 Accepts]: Start accepts. Automaton has 49876 states and 67866 transitions. Word has length 180 [2019-09-07 19:48:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:48:41,735 INFO L475 AbstractCegarLoop]: Abstraction has 49876 states and 67866 transitions. [2019-09-07 19:48:41,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:48:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 49876 states and 67866 transitions. [2019-09-07 19:48:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-07 19:48:41,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:48:41,740 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:48:41,741 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:48:41,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:48:41,741 INFO L82 PathProgramCache]: Analyzing trace with hash -2003306653, now seen corresponding path program 1 times [2019-09-07 19:48:41,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:48:41,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:48:41,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:41,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:48:41,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 127 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:48:41,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:48:41,929 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 19:48:41,962 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 19:48:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:42,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:48:42,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:48:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:48:42,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:48:42,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 19:48:42,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 19:48:42,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 19:48:42,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:48:42,203 INFO L87 Difference]: Start difference. First operand 49876 states and 67866 transitions. Second operand 7 states. [2019-09-07 19:49:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:49:01,203 INFO L93 Difference]: Finished difference Result 146125 states and 206725 transitions. [2019-09-07 19:49:01,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 19:49:01,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 229 [2019-09-07 19:49:01,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:49:01,772 INFO L225 Difference]: With dead ends: 146125 [2019-09-07 19:49:01,772 INFO L226 Difference]: Without dead ends: 96255 [2019-09-07 19:49:01,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-09-07 19:49:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96255 states. [2019-09-07 19:49:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96255 to 84087. [2019-09-07 19:49:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84087 states. [2019-09-07 19:49:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84087 states to 84087 states and 109399 transitions. [2019-09-07 19:49:06,177 INFO L78 Accepts]: Start accepts. Automaton has 84087 states and 109399 transitions. Word has length 229 [2019-09-07 19:49:06,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:49:06,177 INFO L475 AbstractCegarLoop]: Abstraction has 84087 states and 109399 transitions. [2019-09-07 19:49:06,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 19:49:06,178 INFO L276 IsEmpty]: Start isEmpty. Operand 84087 states and 109399 transitions. [2019-09-07 19:49:06,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-07 19:49:06,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:49:06,186 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:49:06,186 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:49:06,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:49:06,186 INFO L82 PathProgramCache]: Analyzing trace with hash -791743877, now seen corresponding path program 1 times [2019-09-07 19:49:06,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:49:06,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:49:06,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:49:06,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:49:06,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:49:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:49:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 19:49:06,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:49:06,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:49:06,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:49:06,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:49:06,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:49:06,346 INFO L87 Difference]: Start difference. First operand 84087 states and 109399 transitions. Second operand 4 states. [2019-09-07 19:49:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:49:16,586 INFO L93 Difference]: Finished difference Result 224416 states and 300651 transitions. [2019-09-07 19:49:16,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:49:16,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2019-09-07 19:49:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:49:17,042 INFO L225 Difference]: With dead ends: 224416 [2019-09-07 19:49:17,042 INFO L226 Difference]: Without dead ends: 140339 [2019-09-07 19:49:17,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:49:17,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140339 states. [2019-09-07 19:49:23,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140339 to 133818. [2019-09-07 19:49:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133818 states. [2019-09-07 19:49:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133818 states to 133818 states and 173908 transitions. [2019-09-07 19:49:23,542 INFO L78 Accepts]: Start accepts. Automaton has 133818 states and 173908 transitions. Word has length 234 [2019-09-07 19:49:23,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:49:23,543 INFO L475 AbstractCegarLoop]: Abstraction has 133818 states and 173908 transitions. [2019-09-07 19:49:23,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:49:23,544 INFO L276 IsEmpty]: Start isEmpty. Operand 133818 states and 173908 transitions. [2019-09-07 19:49:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-07 19:49:23,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:49:23,562 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:49:23,562 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:49:23,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:49:23,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1051070616, now seen corresponding path program 1 times [2019-09-07 19:49:23,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:49:23,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:49:23,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:49:23,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:49:23,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:49:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:49:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 172 proven. 72 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 19:49:23,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:49:23,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:49:24,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:49:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:49:24,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 19:49:24,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:49:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:49:24,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:49:24,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:49:24,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:49:24,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:49:24,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:49:24,337 INFO L87 Difference]: Start difference. First operand 133818 states and 173908 transitions. Second operand 9 states. [2019-09-07 19:49:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:49:57,512 INFO L93 Difference]: Finished difference Result 321443 states and 439902 transitions. [2019-09-07 19:49:57,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 19:49:57,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 315 [2019-09-07 19:49:57,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:49:58,234 INFO L225 Difference]: With dead ends: 321443 [2019-09-07 19:49:58,234 INFO L226 Difference]: Without dead ends: 188434 [2019-09-07 19:49:58,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=403, Invalid=1853, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 19:49:58,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188434 states. [2019-09-07 19:50:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188434 to 182388. [2019-09-07 19:50:01,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182388 states. [2019-09-07 19:50:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182388 states to 182388 states and 235821 transitions. [2019-09-07 19:50:02,247 INFO L78 Accepts]: Start accepts. Automaton has 182388 states and 235821 transitions. Word has length 315 [2019-09-07 19:50:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:50:02,248 INFO L475 AbstractCegarLoop]: Abstraction has 182388 states and 235821 transitions. [2019-09-07 19:50:02,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:50:02,248 INFO L276 IsEmpty]: Start isEmpty. Operand 182388 states and 235821 transitions. [2019-09-07 19:50:02,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-09-07 19:50:02,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:02,271 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:50:02,271 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:02,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:02,271 INFO L82 PathProgramCache]: Analyzing trace with hash 502843893, now seen corresponding path program 1 times [2019-09-07 19:50:02,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:02,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:02,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:02,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:02,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 207 proven. 158 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2019-09-07 19:50:02,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:50:02,583 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:50:02,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:02,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:50:02,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:50:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-09-07 19:50:05,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:50:05,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 19:50:05,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 19:50:05,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 19:50:05,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:50:05,762 INFO L87 Difference]: Start difference. First operand 182388 states and 235821 transitions. Second operand 7 states. [2019-09-07 19:50:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:50:20,966 INFO L93 Difference]: Finished difference Result 388657 states and 539195 transitions. [2019-09-07 19:50:20,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 19:50:20,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 394 [2019-09-07 19:50:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:50:21,988 INFO L225 Difference]: With dead ends: 388657 [2019-09-07 19:50:21,988 INFO L226 Difference]: Without dead ends: 203775 [2019-09-07 19:50:22,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-09-07 19:50:22,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203775 states. [2019-09-07 19:50:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203775 to 196274. [2019-09-07 19:50:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196274 states. [2019-09-07 19:50:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196274 states to 196274 states and 268419 transitions. [2019-09-07 19:50:26,382 INFO L78 Accepts]: Start accepts. Automaton has 196274 states and 268419 transitions. Word has length 394 [2019-09-07 19:50:26,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:50:26,382 INFO L475 AbstractCegarLoop]: Abstraction has 196274 states and 268419 transitions. [2019-09-07 19:50:26,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 19:50:26,383 INFO L276 IsEmpty]: Start isEmpty. Operand 196274 states and 268419 transitions. [2019-09-07 19:50:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-07 19:50:26,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:26,401 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:50:26,402 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:26,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:26,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1210986184, now seen corresponding path program 1 times [2019-09-07 19:50:26,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:26,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:26,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:26,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:26,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-09-07 19:50:26,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:50:26,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:50:26,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:50:26,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:50:26,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:50:26,604 INFO L87 Difference]: Start difference. First operand 196274 states and 268419 transitions. Second operand 3 states. [2019-09-07 19:50:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:50:36,531 INFO L93 Difference]: Finished difference Result 411003 states and 575086 transitions. [2019-09-07 19:50:36,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:50:36,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-09-07 19:50:36,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:50:37,438 INFO L225 Difference]: With dead ends: 411003 [2019-09-07 19:50:37,439 INFO L226 Difference]: Without dead ends: 232771 [2019-09-07 19:50:38,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:50:38,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232771 states. [2019-09-07 19:50:45,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232771 to 231955. [2019-09-07 19:50:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231955 states. [2019-09-07 19:50:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231955 states to 231955 states and 316754 transitions. [2019-09-07 19:50:46,227 INFO L78 Accepts]: Start accepts. Automaton has 231955 states and 316754 transitions. Word has length 398 [2019-09-07 19:50:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:50:46,228 INFO L475 AbstractCegarLoop]: Abstraction has 231955 states and 316754 transitions. [2019-09-07 19:50:46,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:50:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 231955 states and 316754 transitions. [2019-09-07 19:50:46,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-09-07 19:50:46,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:46,265 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:50:46,265 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:46,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:46,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1342216225, now seen corresponding path program 1 times [2019-09-07 19:50:46,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:46,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:46,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:46,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:46,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 259 proven. 71 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-09-07 19:50:46,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:50:46,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:50:46,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:46,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:50:46,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:50:46,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:50:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-09-07 19:50:48,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:50:48,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:50:48,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:50:48,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:50:48,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:50:48,353 INFO L87 Difference]: Start difference. First operand 231955 states and 316754 transitions. Second operand 9 states. [2019-09-07 19:51:15,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:51:15,345 INFO L93 Difference]: Finished difference Result 515528 states and 790628 transitions. [2019-09-07 19:51:15,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 19:51:15,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 475 [2019-09-07 19:51:15,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:51:16,814 INFO L225 Difference]: With dead ends: 515528 [2019-09-07 19:51:16,814 INFO L226 Difference]: Without dead ends: 285224 [2019-09-07 19:51:17,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 19:51:17,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285224 states. [2019-09-07 19:51:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285224 to 278941. [2019-09-07 19:51:28,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278941 states. [2019-09-07 19:51:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278941 states to 278941 states and 383976 transitions. [2019-09-07 19:51:29,743 INFO L78 Accepts]: Start accepts. Automaton has 278941 states and 383976 transitions. Word has length 475 [2019-09-07 19:51:29,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:51:29,743 INFO L475 AbstractCegarLoop]: Abstraction has 278941 states and 383976 transitions. [2019-09-07 19:51:29,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:51:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 278941 states and 383976 transitions. [2019-09-07 19:51:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-09-07 19:51:29,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:51:29,766 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 19:51:29,766 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:51:29,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:51:29,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1540943602, now seen corresponding path program 1 times [2019-09-07 19:51:29,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:51:29,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:51:29,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:51:29,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:51:29,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:51:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:51:30,062 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 200 proven. 155 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-09-07 19:51:30,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:51:30,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:51:30,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:51:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:51:30,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:51:30,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:51:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 464 proven. 2 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-07 19:51:30,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:51:30,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:51:30,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:51:30,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:51:30,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:51:30,343 INFO L87 Difference]: Start difference. First operand 278941 states and 383976 transitions. Second operand 9 states. [2019-09-07 19:51:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:51:51,176 INFO L93 Difference]: Finished difference Result 587840 states and 822870 transitions. [2019-09-07 19:51:51,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 19:51:51,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 491 [2019-09-07 19:51:51,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:51:52,093 INFO L225 Difference]: With dead ends: 587840 [2019-09-07 19:51:52,093 INFO L226 Difference]: Without dead ends: 308814 [2019-09-07 19:51:52,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2019-09-07 19:51:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308814 states. [2019-09-07 19:51:58,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308814 to 302605. [2019-09-07 19:51:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302605 states. [2019-09-07 19:52:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302605 states to 302605 states and 385616 transitions. [2019-09-07 19:52:07,799 INFO L78 Accepts]: Start accepts. Automaton has 302605 states and 385616 transitions. Word has length 491 [2019-09-07 19:52:07,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:52:07,800 INFO L475 AbstractCegarLoop]: Abstraction has 302605 states and 385616 transitions. [2019-09-07 19:52:07,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:52:07,800 INFO L276 IsEmpty]: Start isEmpty. Operand 302605 states and 385616 transitions. [2019-09-07 19:52:07,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2019-09-07 19:52:07,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:52:07,856 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:52:07,856 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:52:07,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:52:07,857 INFO L82 PathProgramCache]: Analyzing trace with hash 469673567, now seen corresponding path program 1 times [2019-09-07 19:52:07,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:52:07,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:52:07,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:52:07,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:52:07,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:52:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:52:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 183 proven. 529 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-09-07 19:52:08,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:52:08,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:52:08,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:52:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:52:08,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:52:08,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:52:08,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:52:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 662 proven. 2 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-07 19:52:10,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:52:10,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 19:52:10,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 19:52:10,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 19:52:10,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:52:10,198 INFO L87 Difference]: Start difference. First operand 302605 states and 385616 transitions. Second operand 16 states. [2019-09-07 19:52:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:52:57,254 INFO L93 Difference]: Finished difference Result 632837 states and 809268 transitions. [2019-09-07 19:52:57,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-07 19:52:57,255 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 652 [2019-09-07 19:52:57,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:52:59,049 INFO L225 Difference]: With dead ends: 632837 [2019-09-07 19:52:59,049 INFO L226 Difference]: Without dead ends: 320558 [2019-09-07 19:52:59,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 731 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4687 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1749, Invalid=10461, Unknown=0, NotChecked=0, Total=12210 [2019-09-07 19:52:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320558 states. [2019-09-07 19:53:04,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320558 to 303535. [2019-09-07 19:53:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303535 states. [2019-09-07 19:53:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303535 states to 303535 states and 364943 transitions. [2019-09-07 19:53:06,861 INFO L78 Accepts]: Start accepts. Automaton has 303535 states and 364943 transitions. Word has length 652 [2019-09-07 19:53:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:53:06,861 INFO L475 AbstractCegarLoop]: Abstraction has 303535 states and 364943 transitions. [2019-09-07 19:53:06,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 19:53:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 303535 states and 364943 transitions. [2019-09-07 19:53:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2019-09-07 19:53:06,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:53:06,912 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:53:06,912 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:53:06,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:53:06,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1195987340, now seen corresponding path program 1 times [2019-09-07 19:53:06,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:53:06,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:53:06,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:53:06,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:53:06,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:53:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:53:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 773 proven. 102 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-09-07 19:53:09,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:53:09,006 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:53:09,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:53:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:53:09,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 19:53:09,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:53:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 585 proven. 2 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2019-09-07 19:53:14,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:53:14,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-09-07 19:53:14,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:53:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:53:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:53:14,130 INFO L87 Difference]: Start difference. First operand 303535 states and 364943 transitions. Second operand 6 states. [2019-09-07 19:53:27,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:53:27,347 INFO L93 Difference]: Finished difference Result 672267 states and 810013 transitions. [2019-09-07 19:53:27,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:53:27,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 677 [2019-09-07 19:53:27,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:53:28,498 INFO L225 Difference]: With dead ends: 672267 [2019-09-07 19:53:28,499 INFO L226 Difference]: Without dead ends: 392377 [2019-09-07 19:53:28,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 683 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 19:53:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392377 states. [2019-09-07 19:53:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392377 to 391544. [2019-09-07 19:53:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391544 states. [2019-09-07 19:53:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391544 states to 391544 states and 459407 transitions. [2019-09-07 19:53:40,061 INFO L78 Accepts]: Start accepts. Automaton has 391544 states and 459407 transitions. Word has length 677 [2019-09-07 19:53:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:53:40,061 INFO L475 AbstractCegarLoop]: Abstraction has 391544 states and 459407 transitions. [2019-09-07 19:53:40,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:53:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 391544 states and 459407 transitions. [2019-09-07 19:53:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2019-09-07 19:53:40,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:53:40,106 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-09-07 19:53:40,107 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:53:40,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:53:40,107 INFO L82 PathProgramCache]: Analyzing trace with hash 922652014, now seen corresponding path program 1 times [2019-09-07 19:53:40,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:53:40,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:53:40,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:53:40,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:53:40,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:53:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:53:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 477 proven. 147 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2019-09-07 19:53:45,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:53:45,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:53:46,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:53:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:53:46,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 1074 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:53:46,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:53:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 910 proven. 2 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-07 19:53:46,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:53:46,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:53:46,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:53:46,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:53:46,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:53:46,580 INFO L87 Difference]: Start difference. First operand 391544 states and 459407 transitions. Second operand 9 states. [2019-09-07 19:54:00,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:54:00,423 INFO L93 Difference]: Finished difference Result 777073 states and 910969 transitions. [2019-09-07 19:54:00,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 19:54:00,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 711 [2019-09-07 19:54:00,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:54:01,495 INFO L225 Difference]: With dead ends: 777073 [2019-09-07 19:54:01,496 INFO L226 Difference]: Without dead ends: 385496 [2019-09-07 19:54:02,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 716 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:54:03,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385496 states. [2019-09-07 19:54:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385496 to 381396. [2019-09-07 19:54:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381396 states. [2019-09-07 19:54:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381396 states to 381396 states and 432114 transitions. [2019-09-07 19:54:20,663 INFO L78 Accepts]: Start accepts. Automaton has 381396 states and 432114 transitions. Word has length 711 [2019-09-07 19:54:20,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:54:20,663 INFO L475 AbstractCegarLoop]: Abstraction has 381396 states and 432114 transitions. [2019-09-07 19:54:20,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:54:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 381396 states and 432114 transitions. [2019-09-07 19:54:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2019-09-07 19:54:20,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:54:20,693 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:54:20,693 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:54:20,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:54:20,694 INFO L82 PathProgramCache]: Analyzing trace with hash 147777553, now seen corresponding path program 1 times [2019-09-07 19:54:20,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:54:20,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:54:20,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:54:20,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:54:20,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:54:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:54:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 442 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-07 19:54:21,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:54:21,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:54:21,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:54:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:54:21,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:54:21,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:54:21,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:54:21,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:54:22,645 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 418 proven. 26 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-07 19:54:22,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:54:22,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-09-07 19:54:22,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:54:22,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:54:22,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:54:22,663 INFO L87 Difference]: Start difference. First operand 381396 states and 432114 transitions. Second operand 9 states. [2019-09-07 19:54:46,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:54:46,747 INFO L93 Difference]: Finished difference Result 773490 states and 944663 transitions. [2019-09-07 19:54:46,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 19:54:46,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 710 [2019-09-07 19:54:46,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:54:48,362 INFO L225 Difference]: With dead ends: 773490 [2019-09-07 19:54:48,363 INFO L226 Difference]: Without dead ends: 431927 [2019-09-07 19:54:48,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 716 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-07 19:54:49,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431927 states. [2019-09-07 19:55:07,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431927 to 409325. [2019-09-07 19:55:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409325 states. [2019-09-07 19:55:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409325 states to 409325 states and 462985 transitions. [2019-09-07 19:55:08,777 INFO L78 Accepts]: Start accepts. Automaton has 409325 states and 462985 transitions. Word has length 710 [2019-09-07 19:55:08,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:55:08,778 INFO L475 AbstractCegarLoop]: Abstraction has 409325 states and 462985 transitions. [2019-09-07 19:55:08,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:55:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 409325 states and 462985 transitions. [2019-09-07 19:55:08,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2019-09-07 19:55:08,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:55:08,812 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:55:08,813 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:55:08,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:55:08,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1242938941, now seen corresponding path program 1 times [2019-09-07 19:55:08,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:55:08,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:55:08,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:55:08,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:55:08,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:55:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:55:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1524 backedges. 380 proven. 297 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2019-09-07 19:55:10,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:55:10,064 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:55:10,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:55:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:55:10,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:55:10,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:55:10,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:55:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1524 backedges. 863 proven. 2 refuted. 0 times theorem prover too weak. 659 trivial. 0 not checked. [2019-09-07 19:55:11,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:55:11,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 19:55:11,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 19:55:11,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 19:55:11,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:55:11,351 INFO L87 Difference]: Start difference. First operand 409325 states and 462985 transitions. Second operand 13 states. [2019-09-07 19:56:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:56:08,654 INFO L93 Difference]: Finished difference Result 1118310 states and 1339626 transitions. [2019-09-07 19:56:08,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-07 19:56:08,655 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 730 [2019-09-07 19:56:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:56:10,980 INFO L225 Difference]: With dead ends: 1118310 [2019-09-07 19:56:10,980 INFO L226 Difference]: Without dead ends: 709799 [2019-09-07 19:56:11,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 799 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3052 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1155, Invalid=7217, Unknown=0, NotChecked=0, Total=8372 [2019-09-07 19:56:21,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709799 states. [2019-09-07 19:56:40,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709799 to 676507. [2019-09-07 19:56:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676507 states. [2019-09-07 19:56:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676507 states to 676507 states and 762586 transitions. [2019-09-07 19:56:42,358 INFO L78 Accepts]: Start accepts. Automaton has 676507 states and 762586 transitions. Word has length 730 [2019-09-07 19:56:42,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:56:42,359 INFO L475 AbstractCegarLoop]: Abstraction has 676507 states and 762586 transitions. [2019-09-07 19:56:42,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 19:56:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 676507 states and 762586 transitions. [2019-09-07 19:56:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2019-09-07 19:56:44,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:56:44,147 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:56:44,148 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:56:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:56:44,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1831933096, now seen corresponding path program 1 times [2019-09-07 19:56:44,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:56:44,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:56:44,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:56:44,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:56:44,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:56:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:56:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 384 proven. 252 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2019-09-07 19:56:46,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:56:46,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:56:46,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:56:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:56:46,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 1415 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 19:56:46,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:56:46,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:56:46,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:56:46,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:56:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 1134 proven. 13 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2019-09-07 19:56:47,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:56:47,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 19:56:47,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 19:56:47,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 19:56:47,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:56:47,640 INFO L87 Difference]: Start difference. First operand 676507 states and 762586 transitions. Second operand 13 states. [2019-09-07 19:57:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:57:59,853 INFO L93 Difference]: Finished difference Result 1374944 states and 1554545 transitions. [2019-09-07 19:57:59,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-09-07 19:57:59,854 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1023 [2019-09-07 19:57:59,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:58:03,727 INFO L225 Difference]: With dead ends: 1374944 [2019-09-07 19:58:03,728 INFO L226 Difference]: Without dead ends: 734200 [2019-09-07 19:58:04,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1240 GetRequests, 1116 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6264 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2127, Invalid=13623, Unknown=0, NotChecked=0, Total=15750 [2019-09-07 19:58:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734200 states.