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/array-examples/standard_running-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:24:28,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:24:28,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:24:28,768 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:24:28,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:24:28,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:24:28,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:24:28,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:24:28,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:24:28,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:24:28,787 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:24:28,788 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:24:28,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:24:28,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:24:28,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:24:28,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:24:28,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:24:28,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:24:28,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:24:28,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:24:28,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:24:28,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:24:28,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:24:28,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:24:28,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:24:28,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:24:28,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:24:28,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:24:28,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:24:28,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:24:28,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:24:28,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:24:28,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:24:28,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:24:28,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:24:28,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:24:28,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:24:28,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:24:28,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:24:28,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:24:28,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:24:28,813 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 10:24:28,828 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:24:28,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:24:28,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:24:28,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:24:28,830 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:24:28,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:24:28,830 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:24:28,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:24:28,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:24:28,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:24:28,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:24:28,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:24:28,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:24:28,831 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:24:28,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:24:28,832 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:24:28,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:24:28,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:24:28,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:24:28,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:24:28,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:24:28,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:24:28,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:24:28,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:24:28,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:24:28,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:24:28,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:24:28,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:24:28,835 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:24:28,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:24:28,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:24:28,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:24:28,891 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:24:28,892 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:24:28,892 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_running-1.i [2019-09-07 10:24:28,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70503293b/be01b41fd46f465cb4d14453bbc0f2ca/FLAG948b322fa [2019-09-07 10:24:29,418 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:24:29,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_running-1.i [2019-09-07 10:24:29,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70503293b/be01b41fd46f465cb4d14453bbc0f2ca/FLAG948b322fa [2019-09-07 10:24:29,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70503293b/be01b41fd46f465cb4d14453bbc0f2ca [2019-09-07 10:24:29,826 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:24:29,827 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:24:29,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:24:29,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:24:29,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:24:29,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:24:29" (1/1) ... [2019-09-07 10:24:29,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30647a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:29, skipping insertion in model container [2019-09-07 10:24:29,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:24:29" (1/1) ... [2019-09-07 10:24:29,844 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:24:29,863 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:24:30,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:24:30,070 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:24:30,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:24:30,259 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:24:30,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:30 WrapperNode [2019-09-07 10:24:30,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:24:30,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:24:30,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:24:30,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:24:30,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:30" (1/1) ... [2019-09-07 10:24:30,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:30" (1/1) ... [2019-09-07 10:24:30,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:30" (1/1) ... [2019-09-07 10:24:30,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:30" (1/1) ... [2019-09-07 10:24:30,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:30" (1/1) ... [2019-09-07 10:24:30,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:30" (1/1) ... [2019-09-07 10:24:30,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:30" (1/1) ... [2019-09-07 10:24:30,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:24:30,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:24:30,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:24:30,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:24:30,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:30" (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 10:24:30,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:24:30,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:24:30,395 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:24:30,395 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:24:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:24:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:24:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 10:24:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:24:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:24:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:24:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:24:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:24:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:24:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:24:30,694 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:24:30,695 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 10:24:30,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:24:30 BoogieIcfgContainer [2019-09-07 10:24:30,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:24:30,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:24:30,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:24:30,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:24:30,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:24:29" (1/3) ... [2019-09-07 10:24:30,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf98cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:24:30, skipping insertion in model container [2019-09-07 10:24:30,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:24:30" (2/3) ... [2019-09-07 10:24:30,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf98cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:24:30, skipping insertion in model container [2019-09-07 10:24:30,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:24:30" (3/3) ... [2019-09-07 10:24:30,722 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_running-1.i [2019-09-07 10:24:30,743 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:24:30,761 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:24:30,781 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:24:30,824 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:24:30,825 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:24:30,825 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:24:30,825 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:24:30,826 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:24:30,826 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:24:30,826 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:24:30,826 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:24:30,826 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:24:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-09-07 10:24:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:24:30,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:30,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:24:30,854 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:30,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:30,861 INFO L82 PathProgramCache]: Analyzing trace with hash -766370701, now seen corresponding path program 1 times [2019-09-07 10:24:30,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:30,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:30,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:30,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:24:30,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:30,992 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 10:24:30,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:24:30,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:24:30,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:24:31,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:24:31,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:24:31,010 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-09-07 10:24:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:24:31,032 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2019-09-07 10:24:31,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:24:31,034 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-07 10:24:31,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:24:31,042 INFO L225 Difference]: With dead ends: 56 [2019-09-07 10:24:31,043 INFO L226 Difference]: Without dead ends: 25 [2019-09-07 10:24:31,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:24:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-07 10:24:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-07 10:24:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-07 10:24:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-09-07 10:24:31,087 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 15 [2019-09-07 10:24:31,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:24:31,088 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-09-07 10:24:31,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:24:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2019-09-07 10:24:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:24:31,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:31,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:24:31,089 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:31,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:31,090 INFO L82 PathProgramCache]: Analyzing trace with hash 288109956, now seen corresponding path program 1 times [2019-09-07 10:24:31,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:31,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:31,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:31,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:24:31,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:31,154 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 10:24:31,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:24:31,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:24:31,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:24:31,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:24:31,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:24:31,158 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2019-09-07 10:24:31,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:24:31,261 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2019-09-07 10:24:31,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:24:31,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 10:24:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:24:31,263 INFO L225 Difference]: With dead ends: 54 [2019-09-07 10:24:31,263 INFO L226 Difference]: Without dead ends: 37 [2019-09-07 10:24:31,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 10:24:31,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-07 10:24:31,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2019-09-07 10:24:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 10:24:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-09-07 10:24:31,282 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2019-09-07 10:24:31,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:24:31,283 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-09-07 10:24:31,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:24:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-09-07 10:24:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:24:31,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:31,289 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] [2019-09-07 10:24:31,289 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:31,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:31,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1452110141, now seen corresponding path program 1 times [2019-09-07 10:24:31,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:31,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:31,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:31,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:24:31,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:31,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 10:24:31,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:24:31,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 10:24:31,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:24:31,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:24:31,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:24:31,444 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 5 states. [2019-09-07 10:24:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:24:31,558 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-09-07 10:24:31,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:24:31,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-07 10:24:31,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:24:31,560 INFO L225 Difference]: With dead ends: 46 [2019-09-07 10:24:31,561 INFO L226 Difference]: Without dead ends: 34 [2019-09-07 10:24:31,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:24:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-07 10:24:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-07 10:24:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 10:24:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-09-07 10:24:31,568 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 27 [2019-09-07 10:24:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:24:31,569 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-09-07 10:24:31,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:24:31,569 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-09-07 10:24:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:24:31,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:31,570 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] [2019-09-07 10:24:31,570 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:31,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:31,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1877196419, now seen corresponding path program 1 times [2019-09-07 10:24:31,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:31,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:31,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:31,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:24:31,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:31,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 10:24:31,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:24:31,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:24:31,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:24:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:31,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:24:31,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:24:31,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-07 10:24:31,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:24:31,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:24:31,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:24:31,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:24:31,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:24:31,795 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 5 states. [2019-09-07 10:24:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:24:31,906 INFO L93 Difference]: Finished difference Result 84 states and 114 transitions. [2019-09-07 10:24:31,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:24:31,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-07 10:24:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:24:31,909 INFO L225 Difference]: With dead ends: 84 [2019-09-07 10:24:31,909 INFO L226 Difference]: Without dead ends: 61 [2019-09-07 10:24:31,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:24:31,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-07 10:24:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2019-09-07 10:24:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-07 10:24:31,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2019-09-07 10:24:31,919 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 27 [2019-09-07 10:24:31,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:24:31,919 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2019-09-07 10:24:31,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:24:31,920 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2019-09-07 10:24:31,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 10:24:31,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:31,921 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:24:31,922 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:31,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:31,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1355439264, now seen corresponding path program 2 times [2019-09-07 10:24:31,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:31,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:31,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:31,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:24:31,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-07 10:24:32,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:24:32,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:24:32,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:24:32,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:24:32,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:24:32,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:24:32,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:24:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-07 10:24:32,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:24:32,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:24:32,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:24:32,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:24:32,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:24:32,131 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand 6 states. [2019-09-07 10:24:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:24:32,251 INFO L93 Difference]: Finished difference Result 114 states and 156 transitions. [2019-09-07 10:24:32,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:24:32,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-09-07 10:24:32,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:24:32,253 INFO L225 Difference]: With dead ends: 114 [2019-09-07 10:24:32,253 INFO L226 Difference]: Without dead ends: 77 [2019-09-07 10:24:32,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:24:32,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-07 10:24:32,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 64. [2019-09-07 10:24:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-07 10:24:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2019-09-07 10:24:32,264 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 39 [2019-09-07 10:24:32,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:24:32,264 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2019-09-07 10:24:32,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:24:32,264 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2019-09-07 10:24:32,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 10:24:32,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:32,266 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:24:32,267 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:32,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:32,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1296674585, now seen corresponding path program 3 times [2019-09-07 10:24:32,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:32,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:32,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:32,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:24:32,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 10:24:32,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:24:32,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:24:32,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:24:32,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:24:32,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:24:32,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:24:32,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:24:32,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:24:32,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:24:32,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:24:32,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:24:32,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:24:32,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-09-07 10:24:32,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:24:32,562 INFO L567 ElimStorePlain]: treesize reduction 4, result has 87.9 percent of original size [2019-09-07 10:24:32,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-07 10:24:32,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-09-07 10:24:32,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:24:32,765 INFO L341 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2019-09-07 10:24:32,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 43 [2019-09-07 10:24:32,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:24:32,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:24:32,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:24:32,810 INFO L567 ElimStorePlain]: treesize reduction 2, result has 93.3 percent of original size [2019-09-07 10:24:32,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-07 10:24:32,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:17 [2019-09-07 10:24:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-07 10:24:32,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:24:32,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 15 [2019-09-07 10:24:32,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:24:32,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:24:32,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:24:32,943 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 15 states. [2019-09-07 10:24:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:24:34,720 INFO L93 Difference]: Finished difference Result 248 states and 357 transitions. [2019-09-07 10:24:34,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 10:24:34,721 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-09-07 10:24:34,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:24:34,725 INFO L225 Difference]: With dead ends: 248 [2019-09-07 10:24:34,725 INFO L226 Difference]: Without dead ends: 197 [2019-09-07 10:24:34,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=634, Invalid=1916, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:24:34,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-07 10:24:34,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 178. [2019-09-07 10:24:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-07 10:24:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 247 transitions. [2019-09-07 10:24:34,747 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 247 transitions. Word has length 51 [2019-09-07 10:24:34,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:24:34,748 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 247 transitions. [2019-09-07 10:24:34,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:24:34,748 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 247 transitions. [2019-09-07 10:24:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-07 10:24:34,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:34,752 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:24:34,752 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:34,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:34,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1040797544, now seen corresponding path program 1 times [2019-09-07 10:24:34,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:34,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:34,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:24:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-09-07 10:24:34,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:24:34,942 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 10:24:34,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:24:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:35,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:24:35,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:24:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-09-07 10:24:35,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:24:35,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 10:24:35,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:24:35,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:24:35,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:24:35,060 INFO L87 Difference]: Start difference. First operand 178 states and 247 transitions. Second operand 10 states. [2019-09-07 10:24:35,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:24:35,260 INFO L93 Difference]: Finished difference Result 399 states and 564 transitions. [2019-09-07 10:24:35,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 10:24:35,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-09-07 10:24:35,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:24:35,264 INFO L225 Difference]: With dead ends: 399 [2019-09-07 10:24:35,265 INFO L226 Difference]: Without dead ends: 240 [2019-09-07 10:24:35,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:24:35,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-07 10:24:35,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 205. [2019-09-07 10:24:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-07 10:24:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 285 transitions. [2019-09-07 10:24:35,296 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 285 transitions. Word has length 87 [2019-09-07 10:24:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:24:35,296 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 285 transitions. [2019-09-07 10:24:35,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:24:35,296 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 285 transitions. [2019-09-07 10:24:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 10:24:35,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:35,300 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:24:35,301 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:35,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:35,301 INFO L82 PathProgramCache]: Analyzing trace with hash 370428881, now seen corresponding path program 2 times [2019-09-07 10:24:35,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:35,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:35,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:35,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:24:35,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-09-07 10:24:35,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:24:35,502 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:24:35,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:24:35,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:24:35,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:24:35,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:24:35,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:24:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-09-07 10:24:35,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:24:35,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:24:35,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:24:35,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:24:35,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:24:35,632 INFO L87 Difference]: Start difference. First operand 205 states and 285 transitions. Second operand 11 states. [2019-09-07 10:24:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:24:35,811 INFO L93 Difference]: Finished difference Result 451 states and 638 transitions. [2019-09-07 10:24:35,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:24:35,811 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-09-07 10:24:35,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:24:35,813 INFO L225 Difference]: With dead ends: 451 [2019-09-07 10:24:35,814 INFO L226 Difference]: Without dead ends: 267 [2019-09-07 10:24:35,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:24:35,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-07 10:24:35,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 232. [2019-09-07 10:24:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-07 10:24:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 323 transitions. [2019-09-07 10:24:35,831 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 323 transitions. Word has length 99 [2019-09-07 10:24:35,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:24:35,832 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 323 transitions. [2019-09-07 10:24:35,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:24:35,832 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 323 transitions. [2019-09-07 10:24:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 10:24:35,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:35,835 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:24:35,835 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:35,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:35,835 INFO L82 PathProgramCache]: Analyzing trace with hash 855562356, now seen corresponding path program 3 times [2019-09-07 10:24:35,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:35,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:35,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:35,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:24:35,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:35,955 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-09-07 10:24:35,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:24:35,955 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 10:24:35,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:24:36,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 10:24:36,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:24:36,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:24:36,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:24:36,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:24:36,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:24:36,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:24:36,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:24:36,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-09-07 10:24:36,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-09-07 10:24:36,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:24:36,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:24:36,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:24:36,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-09-07 10:24:36,198 INFO L341 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-09-07 10:24:36,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2019-09-07 10:24:36,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:24:36,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:24:36,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-07 10:24:36,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-09-07 10:24:38,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:24:38,457 INFO L341 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2019-09-07 10:24:38,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 44 [2019-09-07 10:24:38,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:24:38,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:24:38,485 INFO L567 ElimStorePlain]: treesize reduction 2, result has 92.9 percent of original size [2019-09-07 10:24:38,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-09-07 10:24:38,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:8 [2019-09-07 10:24:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 25 proven. 91 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-09-07 10:24:38,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:24:38,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 24 [2019-09-07 10:24:38,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 10:24:38,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 10:24:38,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=414, Unknown=1, NotChecked=0, Total=552 [2019-09-07 10:24:38,735 INFO L87 Difference]: Start difference. First operand 232 states and 323 transitions. Second operand 24 states. [2019-09-07 10:26:09,310 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 38 [2019-09-07 10:28:13,166 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-07 10:28:37,684 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 37 [2019-09-07 10:28:53,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:53,800 INFO L93 Difference]: Finished difference Result 782 states and 1119 transitions. [2019-09-07 10:28:53,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-07 10:28:53,801 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 111 [2019-09-07 10:28:53,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:53,804 INFO L225 Difference]: With dead ends: 782 [2019-09-07 10:28:53,805 INFO L226 Difference]: Without dead ends: 573 [2019-09-07 10:28:53,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7470 ImplicationChecksByTransitivity, 205.9s TimeCoverageRelationStatistics Valid=3606, Invalid=15812, Unknown=42, NotChecked=0, Total=19460 [2019-09-07 10:28:53,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-09-07 10:28:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 471. [2019-09-07 10:28:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-09-07 10:28:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 667 transitions. [2019-09-07 10:28:53,836 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 667 transitions. Word has length 111 [2019-09-07 10:28:53,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:53,837 INFO L475 AbstractCegarLoop]: Abstraction has 471 states and 667 transitions. [2019-09-07 10:28:53,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 10:28:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 667 transitions. [2019-09-07 10:28:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-07 10:28:53,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:53,840 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:53,840 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:53,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:53,841 INFO L82 PathProgramCache]: Analyzing trace with hash -402916692, now seen corresponding path program 4 times [2019-09-07 10:28:53,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:53,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:53,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:53,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:53,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-07 10:28:54,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:54,048 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 10:28:54,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:54,167 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:28:54,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:54,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:28:54,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:28:54,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:54,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 10:28:54,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 10:28:54,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 10:28:54,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:28:54,226 INFO L87 Difference]: Start difference. First operand 471 states and 667 transitions. Second operand 16 states. [2019-09-07 10:28:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:54,473 INFO L93 Difference]: Finished difference Result 1034 states and 1481 transitions. [2019-09-07 10:28:54,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:28:54,474 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2019-09-07 10:28:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:54,477 INFO L225 Difference]: With dead ends: 1034 [2019-09-07 10:28:54,477 INFO L226 Difference]: Without dead ends: 594 [2019-09-07 10:28:54,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:28:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-07 10:28:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 509. [2019-09-07 10:28:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-09-07 10:28:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 721 transitions. [2019-09-07 10:28:54,501 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 721 transitions. Word has length 159 [2019-09-07 10:28:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:54,502 INFO L475 AbstractCegarLoop]: Abstraction has 509 states and 721 transitions. [2019-09-07 10:28:54,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 10:28:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 721 transitions. [2019-09-07 10:28:54,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-07 10:28:54,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:54,505 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 11, 11, 11, 11, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:54,505 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:54,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:54,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2105551579, now seen corresponding path program 5 times [2019-09-07 10:28:54,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:54,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:54,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:54,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:54,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2019-09-07 10:28:54,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:54,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:28:54,770 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:29:04,868 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-09-07 10:29:04,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:04,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:29:04,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 559 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-09-07 10:29:04,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:04,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 10:29:04,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:29:04,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:29:04,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:29:04,941 INFO L87 Difference]: Start difference. First operand 509 states and 721 transitions. Second operand 17 states. [2019-09-07 10:29:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:05,236 INFO L93 Difference]: Finished difference Result 1108 states and 1587 transitions. [2019-09-07 10:29:05,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:29:05,237 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 171 [2019-09-07 10:29:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:05,240 INFO L225 Difference]: With dead ends: 1108 [2019-09-07 10:29:05,240 INFO L226 Difference]: Without dead ends: 632 [2019-09-07 10:29:05,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:29:05,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-07 10:29:05,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 547. [2019-09-07 10:29:05,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-07 10:29:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 775 transitions. [2019-09-07 10:29:05,278 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 775 transitions. Word has length 171 [2019-09-07 10:29:05,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:05,279 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 775 transitions. [2019-09-07 10:29:05,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:29:05,279 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 775 transitions. [2019-09-07 10:29:05,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-07 10:29:05,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:05,282 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 12, 12, 12, 12, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:05,283 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:05,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:05,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1242160264, now seen corresponding path program 6 times [2019-09-07 10:29:05,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:05,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:05,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:05,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:05,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:05,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 938 trivial. 0 not checked. [2019-09-07 10:29:05,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:05,666 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 10:29:05,692 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:29:07,430 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-07 10:29:07,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:07,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:29:07,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:07,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:29:07,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:29:07,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:29:07,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:29:07,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-09-07 10:29:07,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-09-07 10:29:07,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:29:07,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:29:07,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:29:07,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-09-07 10:29:07,552 INFO L341 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-09-07 10:29:07,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2019-09-07 10:29:07,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:29:07,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:29:07,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:29:07,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-09-07 10:29:07,686 INFO L341 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-09-07 10:29:07,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 59 [2019-09-07 10:29:07,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:29:07,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:29:07,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-07 10:29:07,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2019-09-07 10:29:13,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:29:13,987 INFO L341 Elim1Store]: treesize reduction 53, result has 24.3 percent of original size [2019-09-07 10:29:13,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 47 [2019-09-07 10:29:13,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 10:29:13,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:29:14,010 INFO L567 ElimStorePlain]: treesize reduction 2, result has 92.9 percent of original size [2019-09-07 10:29:14,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-09-07 10:29:14,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:75, output treesize:8 [2019-09-07 10:29:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 79 proven. 254 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2019-09-07 10:29:14,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:14,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-09-07 10:29:14,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 10:29:14,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 10:29:14,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=782, Unknown=3, NotChecked=0, Total=1056 [2019-09-07 10:29:14,363 INFO L87 Difference]: Start difference. First operand 547 states and 775 transitions. Second operand 33 states. [2019-09-07 10:29:37,585 WARN L188 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-07 10:29:51,932 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-07 10:30:16,111 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-07 10:30:32,091 WARN L188 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-07 10:30:52,451 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-07 10:31:18,678 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-07 10:31:34,922 WARN L188 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-07 10:31:59,307 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-07 10:32:27,764 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-07 10:32:44,049 WARN L188 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-07 10:33:12,457 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-07 10:33:40,706 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-07 10:33:57,000 WARN L188 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-07 10:34:29,399 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-07 10:34:57,555 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-07 10:35:11,851 WARN L188 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-07 10:35:46,687 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-07 10:36:19,321 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-07 10:36:33,708 WARN L188 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-07 10:37:12,206 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-07 10:37:46,497 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-07 10:37:57,100 WARN L188 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-07 10:38:39,528 WARN L188 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 55 DAG size of output: 54