java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label25.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:21:22,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:21:22,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:21:23,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:21:23,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:21:23,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:21:23,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:21:23,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:21:23,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:21:23,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:21:23,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:21:23,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:21:23,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:21:23,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:21:23,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:21:23,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:21:23,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:21:23,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:21:23,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:21:23,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:21:23,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:21:23,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:21:23,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:21:23,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:21:23,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:21:23,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:21:23,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:21:23,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:21:23,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:21:23,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:21:23,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:21:23,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:21:23,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:21:23,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:21:23,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:21:23,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:21:23,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:21:23,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:21:23,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:21:23,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:21:23,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:21:23,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 13:21:23,067 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:21:23,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:21:23,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:21:23,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:21:23,069 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:21:23,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:21:23,069 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:21:23,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:21:23,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:21:23,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:21:23,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:21:23,070 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:21:23,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:21:23,070 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:21:23,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:21:23,071 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:21:23,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:21:23,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:21:23,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:21:23,072 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:21:23,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:21:23,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:21:23,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:21:23,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:21:23,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:21:23,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:21:23,073 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:21:23,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:21:23,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:21:23,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:21:23,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:21:23,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:21:23,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:21:23,121 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:21:23,122 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label25.c [2019-09-07 13:21:23,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f47eebbb/4c393c23454047d78f5ba281d3929c49/FLAGa797f7a83 [2019-09-07 13:21:23,895 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:21:23,896 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label25.c [2019-09-07 13:21:23,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f47eebbb/4c393c23454047d78f5ba281d3929c49/FLAGa797f7a83 [2019-09-07 13:21:24,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f47eebbb/4c393c23454047d78f5ba281d3929c49 [2019-09-07 13:21:24,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:21:24,091 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:21:24,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:21:24,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:21:24,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:21:24,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:21:24" (1/1) ... [2019-09-07 13:21:24,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac9408a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:21:24, skipping insertion in model container [2019-09-07 13:21:24,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:21:24" (1/1) ... [2019-09-07 13:21:24,110 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:21:24,192 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:21:25,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:21:25,100 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:21:25,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:21:25,377 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:21:25,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:21:25 WrapperNode [2019-09-07 13:21:25,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:21:25,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:21:25,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:21:25,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:21:25,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:21:25" (1/1) ... [2019-09-07 13:21:25,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:21:25" (1/1) ... [2019-09-07 13:21:25,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:21:25" (1/1) ... [2019-09-07 13:21:25,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:21:25" (1/1) ... [2019-09-07 13:21:25,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:21:25" (1/1) ... [2019-09-07 13:21:25,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:21:25" (1/1) ... [2019-09-07 13:21:25,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:21:25" (1/1) ... [2019-09-07 13:21:25,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:21:25,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:21:25,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:21:25,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:21:25,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:21:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:21:25,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:21:25,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:21:25,661 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 13:21:25,661 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:21:25,661 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 13:21:25,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:21:25,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:21:25,662 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 13:21:25,662 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:21:25,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:21:25,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:21:27,764 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:21:27,764 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:21:27,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:21:27 BoogieIcfgContainer [2019-09-07 13:21:27,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:21:27,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:21:27,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:21:27,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:21:27,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:21:24" (1/3) ... [2019-09-07 13:21:27,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6c5753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:21:27, skipping insertion in model container [2019-09-07 13:21:27,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:21:25" (2/3) ... [2019-09-07 13:21:27,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6c5753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:21:27, skipping insertion in model container [2019-09-07 13:21:27,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:21:27" (3/3) ... [2019-09-07 13:21:27,774 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label25.c [2019-09-07 13:21:27,784 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:21:27,797 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:21:27,815 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:21:27,865 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:21:27,866 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:21:27,866 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:21:27,866 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:21:27,866 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:21:27,866 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:21:27,867 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:21:27,867 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:21:27,867 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:21:27,905 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states. [2019-09-07 13:21:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-07 13:21:27,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:21:27,939 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:21:27,941 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:21:27,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:21:27,947 INFO L82 PathProgramCache]: Analyzing trace with hash 983729877, now seen corresponding path program 1 times [2019-09-07 13:21:27,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:21:27,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:21:28,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:28,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:21:28,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:21:28,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 13:21:28,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:21:28,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:21:28,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:21:28,858 INFO L87 Difference]: Start difference. First operand 311 states. Second operand 4 states. [2019-09-07 13:21:31,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:21:31,024 INFO L93 Difference]: Finished difference Result 1062 states and 1920 transitions. [2019-09-07 13:21:31,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:21:31,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-09-07 13:21:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:21:31,056 INFO L225 Difference]: With dead ends: 1062 [2019-09-07 13:21:31,056 INFO L226 Difference]: Without dead ends: 685 [2019-09-07 13:21:31,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 13:21:31,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-09-07 13:21:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 465. [2019-09-07 13:21:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-07 13:21:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 750 transitions. [2019-09-07 13:21:31,179 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 750 transitions. Word has length 186 [2019-09-07 13:21:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:21:31,180 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 750 transitions. [2019-09-07 13:21:31,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:21:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 750 transitions. [2019-09-07 13:21:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-07 13:21:31,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:21:31,186 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:21:31,186 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:21:31,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:21:31,187 INFO L82 PathProgramCache]: Analyzing trace with hash -93919246, now seen corresponding path program 1 times [2019-09-07 13:21:31,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:21:31,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:21:31,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:31,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:31,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:21:31,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:21:31,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:21:31,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:21:31,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:21:31,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:21:31,420 INFO L87 Difference]: Start difference. First operand 465 states and 750 transitions. Second operand 6 states. [2019-09-07 13:21:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:21:33,087 INFO L93 Difference]: Finished difference Result 1400 states and 2333 transitions. [2019-09-07 13:21:33,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:21:33,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-07 13:21:33,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:21:33,098 INFO L225 Difference]: With dead ends: 1400 [2019-09-07 13:21:33,098 INFO L226 Difference]: Without dead ends: 941 [2019-09-07 13:21:33,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:21:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-09-07 13:21:33,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 900. [2019-09-07 13:21:33,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-09-07 13:21:33,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1442 transitions. [2019-09-07 13:21:33,204 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1442 transitions. Word has length 195 [2019-09-07 13:21:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:21:33,204 INFO L475 AbstractCegarLoop]: Abstraction has 900 states and 1442 transitions. [2019-09-07 13:21:33,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:21:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1442 transitions. [2019-09-07 13:21:33,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-07 13:21:33,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:21:33,210 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 13:21:33,211 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:21:33,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:21:33,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1551317076, now seen corresponding path program 1 times [2019-09-07 13:21:33,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:21:33,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:21:33,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:33,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:33,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:21:33,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:21:33,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:21:33,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:21:33,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:21:33,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:21:33,393 INFO L87 Difference]: Start difference. First operand 900 states and 1442 transitions. Second operand 5 states. [2019-09-07 13:21:34,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:21:34,982 INFO L93 Difference]: Finished difference Result 2692 states and 4483 transitions. [2019-09-07 13:21:34,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:21:34,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 196 [2019-09-07 13:21:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:21:35,000 INFO L225 Difference]: With dead ends: 2692 [2019-09-07 13:21:35,001 INFO L226 Difference]: Without dead ends: 1798 [2019-09-07 13:21:35,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:21:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2019-09-07 13:21:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1763. [2019-09-07 13:21:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2019-09-07 13:21:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2726 transitions. [2019-09-07 13:21:35,071 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2726 transitions. Word has length 196 [2019-09-07 13:21:35,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:21:35,071 INFO L475 AbstractCegarLoop]: Abstraction has 1763 states and 2726 transitions. [2019-09-07 13:21:35,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:21:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2726 transitions. [2019-09-07 13:21:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-07 13:21:35,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:21:35,078 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:21:35,078 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:21:35,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:21:35,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2055964993, now seen corresponding path program 1 times [2019-09-07 13:21:35,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:21:35,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:21:35,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:35,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:35,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:21:35,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:21:35,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:21:35,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:21:35,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:21:35,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:21:35,328 INFO L87 Difference]: Start difference. First operand 1763 states and 2726 transitions. Second operand 3 states. [2019-09-07 13:21:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:21:36,411 INFO L93 Difference]: Finished difference Result 5228 states and 8361 transitions. [2019-09-07 13:21:36,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:21:36,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-09-07 13:21:36,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:21:36,435 INFO L225 Difference]: With dead ends: 5228 [2019-09-07 13:21:36,435 INFO L226 Difference]: Without dead ends: 3471 [2019-09-07 13:21:36,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:21:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3471 states. [2019-09-07 13:21:36,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3471 to 3449. [2019-09-07 13:21:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3449 states. [2019-09-07 13:21:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 5456 transitions. [2019-09-07 13:21:36,564 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 5456 transitions. Word has length 198 [2019-09-07 13:21:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:21:36,564 INFO L475 AbstractCegarLoop]: Abstraction has 3449 states and 5456 transitions. [2019-09-07 13:21:36,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:21:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 5456 transitions. [2019-09-07 13:21:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-07 13:21:36,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:21:36,577 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 13:21:36,578 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:21:36,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:21:36,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1465021675, now seen corresponding path program 1 times [2019-09-07 13:21:36,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:21:36,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:21:36,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:36,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:36,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:21:36,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:21:36,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 13:21:36,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:21:36,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:21:36,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:21:36,776 INFO L87 Difference]: Start difference. First operand 3449 states and 5456 transitions. Second operand 7 states. [2019-09-07 13:21:38,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:21:38,361 INFO L93 Difference]: Finished difference Result 10484 states and 18646 transitions. [2019-09-07 13:21:38,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:21:38,471 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 204 [2019-09-07 13:21:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:21:38,530 INFO L225 Difference]: With dead ends: 10484 [2019-09-07 13:21:38,531 INFO L226 Difference]: Without dead ends: 7041 [2019-09-07 13:21:38,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:21:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7041 states. [2019-09-07 13:21:38,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7041 to 6894. [2019-09-07 13:21:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6894 states. [2019-09-07 13:21:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 11385 transitions. [2019-09-07 13:21:38,831 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 11385 transitions. Word has length 204 [2019-09-07 13:21:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:21:38,831 INFO L475 AbstractCegarLoop]: Abstraction has 6894 states and 11385 transitions. [2019-09-07 13:21:38,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:21:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 11385 transitions. [2019-09-07 13:21:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-07 13:21:38,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:21:38,865 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 13:21:38,866 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:21:38,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:21:38,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1885630442, now seen corresponding path program 1 times [2019-09-07 13:21:38,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:21:38,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:21:38,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:38,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:38,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:21:39,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:21:39,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:21:39,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:21:39,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:21:39,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:21:39,035 INFO L87 Difference]: Start difference. First operand 6894 states and 11385 transitions. Second operand 6 states. [2019-09-07 13:21:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:21:40,756 INFO L93 Difference]: Finished difference Result 20162 states and 35826 transitions. [2019-09-07 13:21:40,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:21:40,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 209 [2019-09-07 13:21:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:21:40,848 INFO L225 Difference]: With dead ends: 20162 [2019-09-07 13:21:40,849 INFO L226 Difference]: Without dead ends: 13274 [2019-09-07 13:21:40,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:21:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13274 states. [2019-09-07 13:21:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13274 to 13159. [2019-09-07 13:21:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13159 states. [2019-09-07 13:21:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13159 states to 13159 states and 20388 transitions. [2019-09-07 13:21:41,326 INFO L78 Accepts]: Start accepts. Automaton has 13159 states and 20388 transitions. Word has length 209 [2019-09-07 13:21:41,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:21:41,326 INFO L475 AbstractCegarLoop]: Abstraction has 13159 states and 20388 transitions. [2019-09-07 13:21:41,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:21:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 13159 states and 20388 transitions. [2019-09-07 13:21:41,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-07 13:21:41,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:21:41,371 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:21:41,372 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:21:41,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:21:41,372 INFO L82 PathProgramCache]: Analyzing trace with hash -433967003, now seen corresponding path program 1 times [2019-09-07 13:21:41,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:21:41,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:21:41,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:41,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:41,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 13:21:41,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:21:41,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:21:41,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:21:41,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:21:41,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:21:41,774 INFO L87 Difference]: Start difference. First operand 13159 states and 20388 transitions. Second operand 3 states. [2019-09-07 13:21:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:21:43,105 INFO L93 Difference]: Finished difference Result 35702 states and 56031 transitions. [2019-09-07 13:21:43,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:21:43,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-09-07 13:21:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:21:43,231 INFO L225 Difference]: With dead ends: 35702 [2019-09-07 13:21:43,231 INFO L226 Difference]: Without dead ends: 22549 [2019-09-07 13:21:43,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:21:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22549 states. [2019-09-07 13:21:43,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22549 to 20062. [2019-09-07 13:21:43,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20062 states. [2019-09-07 13:21:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20062 states to 20062 states and 30165 transitions. [2019-09-07 13:21:43,960 INFO L78 Accepts]: Start accepts. Automaton has 20062 states and 30165 transitions. Word has length 232 [2019-09-07 13:21:43,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:21:43,962 INFO L475 AbstractCegarLoop]: Abstraction has 20062 states and 30165 transitions. [2019-09-07 13:21:43,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:21:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 20062 states and 30165 transitions. [2019-09-07 13:21:44,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-07 13:21:44,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:21:44,024 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:21:44,024 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:21:44,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:21:44,025 INFO L82 PathProgramCache]: Analyzing trace with hash 179457582, now seen corresponding path program 1 times [2019-09-07 13:21:44,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:21:44,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:21:44,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:44,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:44,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 13:21:44,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:21:44,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 13:21:44,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:21:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:44,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 13:21:44,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:21:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-07 13:21:44,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:21:44,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 13:21:44,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:21:44,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:21:44,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:21:44,677 INFO L87 Difference]: Start difference. First operand 20062 states and 30165 transitions. Second operand 9 states. [2019-09-07 13:21:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:21:47,789 INFO L93 Difference]: Finished difference Result 56901 states and 89000 transitions. [2019-09-07 13:21:47,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:21:47,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 249 [2019-09-07 13:21:47,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:21:48,000 INFO L225 Difference]: With dead ends: 56901 [2019-09-07 13:21:48,000 INFO L226 Difference]: Without dead ends: 36845 [2019-09-07 13:21:48,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-09-07 13:21:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36845 states. [2019-09-07 13:21:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36845 to 36515. [2019-09-07 13:21:49,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36515 states. [2019-09-07 13:21:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36515 states to 36515 states and 50990 transitions. [2019-09-07 13:21:49,597 INFO L78 Accepts]: Start accepts. Automaton has 36515 states and 50990 transitions. Word has length 249 [2019-09-07 13:21:49,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:21:49,597 INFO L475 AbstractCegarLoop]: Abstraction has 36515 states and 50990 transitions. [2019-09-07 13:21:49,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:21:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 36515 states and 50990 transitions. [2019-09-07 13:21:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-07 13:21:49,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:21:49,664 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:21:49,665 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:21:49,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:21:49,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2120983184, now seen corresponding path program 1 times [2019-09-07 13:21:49,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:21:49,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:21:49,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:49,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:21:49,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:21:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:21:49,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:21:49,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 13:21:49,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:21:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:21:50,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:21:50,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:21:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 13:21:50,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:21:50,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 13:21:50,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:21:50,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:21:50,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:21:50,596 INFO L87 Difference]: Start difference. First operand 36515 states and 50990 transitions. Second operand 7 states. [2019-09-07 13:21:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:21:58,838 INFO L93 Difference]: Finished difference Result 122794 states and 183700 transitions. [2019-09-07 13:21:58,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 13:21:58,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 284 [2019-09-07 13:21:58,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:21:59,342 INFO L225 Difference]: With dead ends: 122794 [2019-09-07 13:21:59,342 INFO L226 Difference]: Without dead ends: 86285 [2019-09-07 13:21:59,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2019-09-07 13:21:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86285 states. [2019-09-07 13:22:02,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86285 to 79233. [2019-09-07 13:22:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79233 states. [2019-09-07 13:22:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79233 states to 79233 states and 103728 transitions. [2019-09-07 13:22:02,268 INFO L78 Accepts]: Start accepts. Automaton has 79233 states and 103728 transitions. Word has length 284 [2019-09-07 13:22:02,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:22:02,268 INFO L475 AbstractCegarLoop]: Abstraction has 79233 states and 103728 transitions. [2019-09-07 13:22:02,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:22:02,269 INFO L276 IsEmpty]: Start isEmpty. Operand 79233 states and 103728 transitions. [2019-09-07 13:22:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-07 13:22:02,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:22:02,352 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:22:02,352 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:22:02,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:22:02,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1391013711, now seen corresponding path program 1 times [2019-09-07 13:22:02,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:22:02,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:22:02,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:22:02,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:22:02,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:22:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:22:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 123 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:22:02,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:22:02,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 13:22:02,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:22:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:22:03,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 13:22:03,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:22:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 13:22:03,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:22:03,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 13:22:03,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:22:03,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:22:03,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:22:03,263 INFO L87 Difference]: Start difference. First operand 79233 states and 103728 transitions. Second operand 7 states. [2019-09-07 13:22:09,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:22:09,671 INFO L93 Difference]: Finished difference Result 165473 states and 229086 transitions. [2019-09-07 13:22:09,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 13:22:09,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 296 [2019-09-07 13:22:09,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:22:10,050 INFO L225 Difference]: With dead ends: 165473 [2019-09-07 13:22:10,050 INFO L226 Difference]: Without dead ends: 86248 [2019-09-07 13:22:10,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2019-09-07 13:22:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86248 states. [2019-09-07 13:22:12,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86248 to 79697. [2019-09-07 13:22:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79697 states. [2019-09-07 13:22:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79697 states to 79697 states and 95669 transitions. [2019-09-07 13:22:12,725 INFO L78 Accepts]: Start accepts. Automaton has 79697 states and 95669 transitions. Word has length 296 [2019-09-07 13:22:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:22:12,726 INFO L475 AbstractCegarLoop]: Abstraction has 79697 states and 95669 transitions. [2019-09-07 13:22:12,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:22:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 79697 states and 95669 transitions. [2019-09-07 13:22:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-07 13:22:12,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:22:12,850 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:22:12,850 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:22:12,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:22:12,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1684025639, now seen corresponding path program 1 times [2019-09-07 13:22:12,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:22:12,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:22:12,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:22:12,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:22:12,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:22:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:22:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 185 proven. 14 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-09-07 13:22:14,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:22:14,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:22:14,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:22:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:22:14,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 1502 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 13:22:14,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:22:14,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:22:14,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 13:22:14,919 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-09-07 13:22:14,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:22:14,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-07 13:22:14,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:22:14,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:22:14,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:22:14,926 INFO L87 Difference]: Start difference. First operand 79697 states and 95669 transitions. Second operand 9 states. [2019-09-07 13:22:24,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:22:24,224 INFO L93 Difference]: Finished difference Result 292911 states and 384579 transitions. [2019-09-07 13:22:24,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 13:22:24,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 373 [2019-09-07 13:22:24,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:22:25,054 INFO L225 Difference]: With dead ends: 292911 [2019-09-07 13:22:25,054 INFO L226 Difference]: Without dead ends: 215141 [2019-09-07 13:22:25,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=588, Invalid=2834, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 13:22:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215141 states. [2019-09-07 13:22:31,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215141 to 200751. [2019-09-07 13:22:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200751 states. [2019-09-07 13:22:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200751 states to 200751 states and 246289 transitions. [2019-09-07 13:22:31,692 INFO L78 Accepts]: Start accepts. Automaton has 200751 states and 246289 transitions. Word has length 373 [2019-09-07 13:22:31,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:22:31,693 INFO L475 AbstractCegarLoop]: Abstraction has 200751 states and 246289 transitions. [2019-09-07 13:22:31,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:22:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 200751 states and 246289 transitions. [2019-09-07 13:22:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-07 13:22:31,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:22:31,882 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:22:31,882 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:22:31,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:22:31,883 INFO L82 PathProgramCache]: Analyzing trace with hash 320655369, now seen corresponding path program 1 times [2019-09-07 13:22:31,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:22:31,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:22:31,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:22:31,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:22:31,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:22:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:22:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 182 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 13:22:32,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:22:32,229 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:22:32,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:22:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:22:32,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 13:22:32,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:22:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-07 13:22:32,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:22:32,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 13:22:32,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:22:32,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:22:32,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:22:32,739 INFO L87 Difference]: Start difference. First operand 200751 states and 246289 transitions. Second operand 9 states. [2019-09-07 13:22:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:22:38,880 INFO L93 Difference]: Finished difference Result 417444 states and 513436 transitions. [2019-09-07 13:22:38,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 13:22:38,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 374 [2019-09-07 13:22:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:22:39,560 INFO L225 Difference]: With dead ends: 417444 [2019-09-07 13:22:39,561 INFO L226 Difference]: Without dead ends: 218431 [2019-09-07 13:22:40,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2019-09-07 13:22:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218431 states. [2019-09-07 13:22:47,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218431 to 212754. [2019-09-07 13:22:47,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212754 states. [2019-09-07 13:22:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212754 states to 212754 states and 256826 transitions. [2019-09-07 13:22:47,475 INFO L78 Accepts]: Start accepts. Automaton has 212754 states and 256826 transitions. Word has length 374 [2019-09-07 13:22:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:22:47,476 INFO L475 AbstractCegarLoop]: Abstraction has 212754 states and 256826 transitions. [2019-09-07 13:22:47,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:22:47,476 INFO L276 IsEmpty]: Start isEmpty. Operand 212754 states and 256826 transitions. [2019-09-07 13:22:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-09-07 13:22:47,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:22:47,655 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:22:47,656 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:22:47,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:22:47,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1236358269, now seen corresponding path program 1 times [2019-09-07 13:22:47,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:22:47,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:22:47,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:22:47,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:22:47,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:22:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:22:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 244 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:22:48,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:22:48,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 13:22:48,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:22:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:22:48,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 13:22:48,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:22:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-07 13:22:49,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:22:49,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 13:22:49,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:22:49,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:22:49,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:22:49,137 INFO L87 Difference]: Start difference. First operand 212754 states and 256826 transitions. Second operand 9 states. [2019-09-07 13:23:06,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:23:06,155 INFO L93 Difference]: Finished difference Result 684072 states and 929416 transitions. [2019-09-07 13:23:06,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 13:23:06,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 378 [2019-09-07 13:23:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:23:08,857 INFO L225 Difference]: With dead ends: 684072 [2019-09-07 13:23:08,857 INFO L226 Difference]: Without dead ends: 473277 [2019-09-07 13:23:09,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=766, Unknown=0, NotChecked=0, Total=992 [2019-09-07 13:23:09,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473277 states. [2019-09-07 13:23:27,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473277 to 451271. [2019-09-07 13:23:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451271 states. [2019-09-07 13:23:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451271 states to 451271 states and 539336 transitions. [2019-09-07 13:23:28,202 INFO L78 Accepts]: Start accepts. Automaton has 451271 states and 539336 transitions. Word has length 378 [2019-09-07 13:23:28,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:23:28,202 INFO L475 AbstractCegarLoop]: Abstraction has 451271 states and 539336 transitions. [2019-09-07 13:23:28,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:23:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 451271 states and 539336 transitions. [2019-09-07 13:23:28,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-09-07 13:23:28,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:23:28,461 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:23:28,461 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:23:28,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:23:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1921045650, now seen corresponding path program 1 times [2019-09-07 13:23:28,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:23:28,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:23:28,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:23:28,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:23:28,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:23:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:23:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 285 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:23:28,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:23:28,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 13:23:29,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:23:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:23:29,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 13:23:29,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:23:34,844 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-09-07 13:23:34,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:23:34,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-07 13:23:34,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 13:23:34,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 13:23:34,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-07 13:23:34,850 INFO L87 Difference]: Start difference. First operand 451271 states and 539336 transitions. Second operand 13 states. [2019-09-07 13:23:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:23:57,667 INFO L93 Difference]: Finished difference Result 1085404 states and 1350816 transitions. [2019-09-07 13:23:57,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-07 13:23:57,668 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 384 [2019-09-07 13:23:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:24:00,358 INFO L225 Difference]: With dead ends: 1085404 [2019-09-07 13:24:00,358 INFO L226 Difference]: Without dead ends: 636065 [2019-09-07 13:24:00,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6156 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1978, Invalid=13772, Unknown=0, NotChecked=0, Total=15750 [2019-09-07 13:24:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636065 states. [2019-09-07 13:24:31,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636065 to 625739. [2019-09-07 13:24:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625739 states. [2019-09-07 13:24:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625739 states to 625739 states and 751367 transitions. [2019-09-07 13:24:33,866 INFO L78 Accepts]: Start accepts. Automaton has 625739 states and 751367 transitions. Word has length 384 [2019-09-07 13:24:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:24:33,866 INFO L475 AbstractCegarLoop]: Abstraction has 625739 states and 751367 transitions. [2019-09-07 13:24:33,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 13:24:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 625739 states and 751367 transitions. [2019-09-07 13:24:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-09-07 13:24:34,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:24:34,606 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:24:34,607 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:24:34,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:24:34,607 INFO L82 PathProgramCache]: Analyzing trace with hash 370874605, now seen corresponding path program 1 times [2019-09-07 13:24:34,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:24:34,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:24:34,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:24:34,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:24:34,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:24:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:24:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 348 proven. 163 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 13:24:35,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:24:35,714 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 13:24:35,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:24:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:24:35,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 1580 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:24:36,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:24:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-09-07 13:24:36,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:24:36,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-09-07 13:24:36,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 13:24:36,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 13:24:36,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:24:36,133 INFO L87 Difference]: Start difference. First operand 625739 states and 751367 transitions. Second operand 11 states. [2019-09-07 13:25:36,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:25:36,796 INFO L93 Difference]: Finished difference Result 1848169 states and 2362669 transitions. [2019-09-07 13:25:36,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 13:25:36,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 469 [2019-09-07 13:25:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:25:43,591 INFO L225 Difference]: With dead ends: 1848169 [2019-09-07 13:25:43,592 INFO L226 Difference]: Without dead ends: 1224596 [2019-09-07 13:25:45,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 13:25:46,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224596 states. [2019-09-07 13:26:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224596 to 1151721. [2019-09-07 13:26:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151721 states. [2019-09-07 13:27:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151721 states to 1151721 states and 1357198 transitions. [2019-09-07 13:27:01,489 INFO L78 Accepts]: Start accepts. Automaton has 1151721 states and 1357198 transitions. Word has length 469 [2019-09-07 13:27:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:27:01,490 INFO L475 AbstractCegarLoop]: Abstraction has 1151721 states and 1357198 transitions. [2019-09-07 13:27:01,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 13:27:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1151721 states and 1357198 transitions. [2019-09-07 13:27:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2019-09-07 13:27:02,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:27:02,948 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:27:02,948 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:27:02,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:27:02,949 INFO L82 PathProgramCache]: Analyzing trace with hash -689094651, now seen corresponding path program 1 times [2019-09-07 13:27:02,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:27:02,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:27:02,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:27:02,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:27:02,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:27:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:27:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 461 proven. 145 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-09-07 13:27:05,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:27:05,756 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) [2019-09-07 13:27:05,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:27:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:27:06,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 2123 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 13:27:06,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:27:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 584 proven. 2 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-09-07 13:27:06,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:27:06,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 13:27:06,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:27:06,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:27:06,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:27:06,324 INFO L87 Difference]: Start difference. First operand 1151721 states and 1357198 transitions. Second operand 9 states.