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_init8_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:09:50,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:09:50,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:09:50,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:09:50,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:09:50,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:09:50,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:09:50,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:09:50,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:09:50,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:09:50,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:09:50,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:09:50,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:09:50,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:09:50,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:09:50,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:09:50,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:09:50,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:09:50,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:09:50,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:09:50,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:09:50,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:09:50,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:09:50,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:09:50,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:09:50,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:09:50,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:09:50,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:09:50,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:09:50,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:09:50,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:09:50,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:09:50,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:09:50,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:09:50,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:09:50,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:09:50,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:09:50,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:09:50,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:09:50,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:09:50,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:09:50,331 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:09:50,347 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:09:50,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:09:50,348 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:09:50,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:09:50,349 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:09:50,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:09:50,349 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:09:50,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:09:50,350 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:09:50,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:09:50,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:09:50,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:09:50,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:09:50,351 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:09:50,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:09:50,351 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:09:50,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:09:50,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:09:50,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:09:50,352 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:09:50,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:09:50,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:09:50,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:09:50,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:09:50,353 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:09:50,353 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:09:50,354 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:09:50,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:09:50,354 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:09:50,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:09:50,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:09:50,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:09:50,421 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:09:50,421 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:09:50,422 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init8_ground-1.i [2019-09-07 10:09:50,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7366cdcfb/861ae9ea2d124a1caac9eddc086c9c44/FLAG0b986b63d [2019-09-07 10:09:51,015 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:09:51,018 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init8_ground-1.i [2019-09-07 10:09:51,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7366cdcfb/861ae9ea2d124a1caac9eddc086c9c44/FLAG0b986b63d [2019-09-07 10:09:51,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7366cdcfb/861ae9ea2d124a1caac9eddc086c9c44 [2019-09-07 10:09:51,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:09:51,404 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:09:51,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:09:51,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:09:51,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:09:51,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:09:51" (1/1) ... [2019-09-07 10:09:51,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f71350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:09:51, skipping insertion in model container [2019-09-07 10:09:51,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:09:51" (1/1) ... [2019-09-07 10:09:51,422 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:09:51,441 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:09:51,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:09:51,670 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:09:51,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:09:51,808 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:09:51,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:09:51 WrapperNode [2019-09-07 10:09:51,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:09:51,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:09:51,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:09:51,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:09:51,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:09:51" (1/1) ... [2019-09-07 10:09:51,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:09:51" (1/1) ... [2019-09-07 10:09:51,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:09:51" (1/1) ... [2019-09-07 10:09:51,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:09:51" (1/1) ... [2019-09-07 10:09:51,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:09:51" (1/1) ... [2019-09-07 10:09:51,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:09:51" (1/1) ... [2019-09-07 10:09:51,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:09:51" (1/1) ... [2019-09-07 10:09:51,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:09:51,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:09:51,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:09:51,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:09:51,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:09:51" (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:09:51,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:09:51,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:09:51,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:09:51,924 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:09:51,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:09:51,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:09:51,924 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:09:51,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:09:51,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:09:51,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:09:51,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:09:51,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:09:51,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:09:52,233 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:09:52,234 INFO L283 CfgBuilder]: Removed 9 assume(true) statements. [2019-09-07 10:09:52,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:09:52 BoogieIcfgContainer [2019-09-07 10:09:52,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:09:52,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:09:52,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:09:52,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:09:52,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:09:51" (1/3) ... [2019-09-07 10:09:52,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2efc59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:09:52, skipping insertion in model container [2019-09-07 10:09:52,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:09:51" (2/3) ... [2019-09-07 10:09:52,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2efc59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:09:52, skipping insertion in model container [2019-09-07 10:09:52,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:09:52" (3/3) ... [2019-09-07 10:09:52,244 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_init8_ground-1.i [2019-09-07 10:09:52,255 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:09:52,264 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:09:52,283 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:09:52,338 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:09:52,340 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:09:52,340 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:09:52,341 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:09:52,341 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:09:52,341 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:09:52,342 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:09:52,342 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:09:52,342 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:09:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-09-07 10:09:52,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:09:52,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:09:52,381 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:09:52,383 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:09:52,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:09:52,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1916738342, now seen corresponding path program 1 times [2019-09-07 10:09:52,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:09:52,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:09:52,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:52,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:09:52,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:09:52,543 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:09:52,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:09:52,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:09:52,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:09:52,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:09:52,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:09:52,569 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2019-09-07 10:09:52,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:09:52,600 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2019-09-07 10:09:52,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:09:52,602 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2019-09-07 10:09:52,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:09:52,611 INFO L225 Difference]: With dead ends: 67 [2019-09-07 10:09:52,612 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 10:09:52,616 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:09:52,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 10:09:52,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-07 10:09:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 10:09:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-09-07 10:09:52,664 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 27 [2019-09-07 10:09:52,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:09:52,665 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-09-07 10:09:52,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:09:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-09-07 10:09:52,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:09:52,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:09:52,669 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:09:52,670 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:09:52,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:09:52,672 INFO L82 PathProgramCache]: Analyzing trace with hash -330794466, now seen corresponding path program 1 times [2019-09-07 10:09:52,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:09:52,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:09:52,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:52,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:09:52,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:09:52,804 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:09:52,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:09:52,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:09:52,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:09:52,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:09:52,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:09:52,809 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 3 states. [2019-09-07 10:09:52,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:09:52,907 INFO L93 Difference]: Finished difference Result 65 states and 88 transitions. [2019-09-07 10:09:52,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:09:52,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-07 10:09:52,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:09:52,910 INFO L225 Difference]: With dead ends: 65 [2019-09-07 10:09:52,910 INFO L226 Difference]: Without dead ends: 40 [2019-09-07 10:09:52,911 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:09:52,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-07 10:09:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-07 10:09:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 10:09:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-09-07 10:09:52,923 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2019-09-07 10:09:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:09:52,923 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-09-07 10:09:52,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:09:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-09-07 10:09:52,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 10:09:52,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:09:52,925 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:09:52,926 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:09:52,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:09:52,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1167956326, now seen corresponding path program 1 times [2019-09-07 10:09:52,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:09:52,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:09:52,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:52,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:09:52,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:09:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 10:09:53,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:09:53,008 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:09:53,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:09:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:09:53,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:09:53,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:09:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 10:09:53,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:09:53,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:09:53,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:09:53,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:09:53,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:09:53,117 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 5 states. [2019-09-07 10:09:53,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:09:53,258 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2019-09-07 10:09:53,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:09:53,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-09-07 10:09:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:09:53,261 INFO L225 Difference]: With dead ends: 80 [2019-09-07 10:09:53,261 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 10:09:53,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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:09:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 10:09:53,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-07 10:09:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-07 10:09:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2019-09-07 10:09:53,272 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 35 [2019-09-07 10:09:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:09:53,273 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-09-07 10:09:53,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:09:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2019-09-07 10:09:53,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 10:09:53,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:09:53,275 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:09:53,276 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:09:53,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:09:53,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1255820446, now seen corresponding path program 2 times [2019-09-07 10:09:53,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:09:53,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:09:53,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:53,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:09:53,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:09:53,381 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 10:09:53,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:09:53,382 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:09:53,399 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:09:53,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:09:53,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:09:53,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:09:53,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:09:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 10:09:53,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:09:53,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:09:53,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:09:53,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:09:53,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:09:53,489 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 6 states. [2019-09-07 10:09:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:09:53,617 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2019-09-07 10:09:53,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:09:53,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-09-07 10:09:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:09:53,619 INFO L225 Difference]: With dead ends: 95 [2019-09-07 10:09:53,619 INFO L226 Difference]: Without dead ends: 56 [2019-09-07 10:09:53,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 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:09:53,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-07 10:09:53,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-07 10:09:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-07 10:09:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2019-09-07 10:09:53,629 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 43 [2019-09-07 10:09:53,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:09:53,629 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-09-07 10:09:53,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:09:53,629 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2019-09-07 10:09:53,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 10:09:53,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:09:53,631 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 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:09:53,632 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:09:53,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:09:53,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2017193242, now seen corresponding path program 3 times [2019-09-07 10:09:53,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:09:53,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:09:53,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:53,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:09:53,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:09:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-07 10:09:53,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:09:53,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:09:53,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:09:53,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:09:53,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:09:53,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:09:53,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:09:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-07 10:09:53,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:09:53,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:09:53,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:09:53,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:09:53,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:09:53,928 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 7 states. [2019-09-07 10:09:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:09:54,063 INFO L93 Difference]: Finished difference Result 110 states and 133 transitions. [2019-09-07 10:09:54,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:09:54,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-09-07 10:09:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:09:54,065 INFO L225 Difference]: With dead ends: 110 [2019-09-07 10:09:54,065 INFO L226 Difference]: Without dead ends: 64 [2019-09-07 10:09:54,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:09:54,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-07 10:09:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-07 10:09:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-07 10:09:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2019-09-07 10:09:54,075 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 51 [2019-09-07 10:09:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:09:54,075 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2019-09-07 10:09:54,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:09:54,076 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2019-09-07 10:09:54,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 10:09:54,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:09:54,078 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 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:09:54,078 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:09:54,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:09:54,078 INFO L82 PathProgramCache]: Analyzing trace with hash 544374558, now seen corresponding path program 4 times [2019-09-07 10:09:54,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:09:54,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:09:54,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:54,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:09:54,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:09:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 10:09:54,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:09:54,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:09:54,207 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:09:54,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:09:54,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:09:54,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:09:54,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:09:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 10:09:54,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:09:54,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 10:09:54,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 10:09:54,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 10:09:54,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:09:54,308 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 8 states. [2019-09-07 10:09:54,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:09:54,446 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2019-09-07 10:09:54,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:09:54,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-09-07 10:09:54,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:09:54,448 INFO L225 Difference]: With dead ends: 125 [2019-09-07 10:09:54,448 INFO L226 Difference]: Without dead ends: 72 [2019-09-07 10:09:54,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:09:54,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-07 10:09:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-07 10:09:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-07 10:09:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2019-09-07 10:09:54,458 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 59 [2019-09-07 10:09:54,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:09:54,459 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2019-09-07 10:09:54,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 10:09:54,459 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2019-09-07 10:09:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 10:09:54,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:09:54,460 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 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:09:54,461 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:09:54,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:09:54,461 INFO L82 PathProgramCache]: Analyzing trace with hash 325227418, now seen corresponding path program 5 times [2019-09-07 10:09:54,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:09:54,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:09:54,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:54,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:09:54,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:09:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:09:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 10:09:54,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:09:54,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:09:54,646 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:10:08,294 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-07 10:10:08,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:10:08,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:10:08,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:10:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 10:10:08,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:10:08,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 10:10:08,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 10:10:08,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 10:10:08,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:10:08,360 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 9 states. [2019-09-07 10:10:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:10:08,511 INFO L93 Difference]: Finished difference Result 140 states and 163 transitions. [2019-09-07 10:10:08,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 10:10:08,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-07 10:10:08,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:10:08,513 INFO L225 Difference]: With dead ends: 140 [2019-09-07 10:10:08,513 INFO L226 Difference]: Without dead ends: 80 [2019-09-07 10:10:08,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:10:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-07 10:10:08,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-07 10:10:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-07 10:10:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-07 10:10:08,523 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 67 [2019-09-07 10:10:08,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:10:08,523 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-07 10:10:08,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 10:10:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-07 10:10:08,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 10:10:08,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:10:08,525 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 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:10:08,525 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:10:08,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:10:08,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1206981022, now seen corresponding path program 6 times [2019-09-07 10:10:08,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:10:08,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:10:08,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:10:08,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:10:08,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:10:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:10:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-07 10:10:08,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:10:08,676 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:10:08,694 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:10:10,792 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-07 10:10:10,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:10:10,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:10:10,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:10:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-07 10:10:10,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:10:10,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 10:10:10,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:10:10,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:10:10,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:10:10,828 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 10 states. [2019-09-07 10:10:11,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:10:11,013 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2019-09-07 10:10:11,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 10:10:11,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2019-09-07 10:10:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:10:11,014 INFO L225 Difference]: With dead ends: 155 [2019-09-07 10:10:11,014 INFO L226 Difference]: Without dead ends: 88 [2019-09-07 10:10:11,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 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:10:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-07 10:10:11,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-09-07 10:10:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 10:10:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2019-09-07 10:10:11,024 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 75 [2019-09-07 10:10:11,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:10:11,024 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2019-09-07 10:10:11,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:10:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2019-09-07 10:10:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 10:10:11,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:10:11,026 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 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:10:11,026 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:10:11,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:10:11,026 INFO L82 PathProgramCache]: Analyzing trace with hash 192305690, now seen corresponding path program 7 times [2019-09-07 10:10:11,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:10:11,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:10:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:10:11,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:10:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:10:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:10:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-07 10:10:11,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:10:11,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:10:11,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:10:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:10:11,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:10:11,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:10:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-07 10:10:11,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:10:11,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:10:11,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:10:11,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:10:11,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:10:11,294 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 11 states. [2019-09-07 10:10:11,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:10:11,477 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2019-09-07 10:10:11,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:10:11,477 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-09-07 10:10:11,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:10:11,478 INFO L225 Difference]: With dead ends: 170 [2019-09-07 10:10:11,478 INFO L226 Difference]: Without dead ends: 96 [2019-09-07 10:10:11,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 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:10:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-07 10:10:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-07 10:10:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-07 10:10:11,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-09-07 10:10:11,498 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 83 [2019-09-07 10:10:11,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:10:11,498 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-09-07 10:10:11,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:10:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-09-07 10:10:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 10:10:11,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:10:11,501 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 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:10:11,501 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:10:11,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:10:11,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1640627170, now seen corresponding path program 8 times [2019-09-07 10:10:11,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:10:11,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:10:11,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:10:11,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:10:11,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:10:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:10:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-09-07 10:10:11,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:10:11,638 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:10:11,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:10:11,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:10:11,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:10:11,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 10:10:11,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:10:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:10:11,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:10:11,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-07 10:10:11,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 10:10:11,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 10:10:11,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:10:11,753 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 12 states. [2019-09-07 10:10:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:10:11,955 INFO L93 Difference]: Finished difference Result 185 states and 208 transitions. [2019-09-07 10:10:11,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 10:10:11,956 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2019-09-07 10:10:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:10:11,958 INFO L225 Difference]: With dead ends: 185 [2019-09-07 10:10:11,958 INFO L226 Difference]: Without dead ends: 104 [2019-09-07 10:10:11,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:10:11,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-07 10:10:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-07 10:10:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-07 10:10:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-09-07 10:10:11,968 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 91 [2019-09-07 10:10:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:10:11,968 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-09-07 10:10:11,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 10:10:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-09-07 10:10:11,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 10:10:11,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:10:11,970 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 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:10:11,970 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:10:11,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:10:11,970 INFO L82 PathProgramCache]: Analyzing trace with hash -32030566, now seen corresponding path program 9 times [2019-09-07 10:10:11,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:10:11,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:10:11,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:10:11,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:10:11,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:10:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:10:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-07 10:10:12,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:10:12,163 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:10:12,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:10:33,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 10:10:33,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:10:33,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 10:10:33,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:10:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-07 10:10:33,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:10:33,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 10:10:33,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 10:10:33,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 10:10:33,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:10:33,511 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 13 states. [2019-09-07 10:10:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:10:33,724 INFO L93 Difference]: Finished difference Result 200 states and 223 transitions. [2019-09-07 10:10:33,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 10:10:33,725 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2019-09-07 10:10:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:10:33,726 INFO L225 Difference]: With dead ends: 200 [2019-09-07 10:10:33,726 INFO L226 Difference]: Without dead ends: 112 [2019-09-07 10:10:33,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:10:33,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-07 10:10:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-07 10:10:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-07 10:10:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2019-09-07 10:10:33,735 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 99 [2019-09-07 10:10:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:10:33,735 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2019-09-07 10:10:33,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 10:10:33,736 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2019-09-07 10:10:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-07 10:10:33,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:10:33,737 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 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:10:33,737 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:10:33,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:10:33,738 INFO L82 PathProgramCache]: Analyzing trace with hash 35739294, now seen corresponding path program 10 times [2019-09-07 10:10:33,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:10:33,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:10:33,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:10:33,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:10:33,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:10:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:10:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-09-07 10:10:33,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:10:33,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:10:33,900 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:10:33,968 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:10:33,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:10:33,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:10:33,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:10:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:10:34,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:10:34,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 10:10:34,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:10:34,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:10:34,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:10:34,006 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 14 states. [2019-09-07 10:10:34,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:10:34,227 INFO L93 Difference]: Finished difference Result 215 states and 238 transitions. [2019-09-07 10:10:34,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 10:10:34,228 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2019-09-07 10:10:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:10:34,229 INFO L225 Difference]: With dead ends: 215 [2019-09-07 10:10:34,229 INFO L226 Difference]: Without dead ends: 120 [2019-09-07 10:10:34,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:10:34,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-07 10:10:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-09-07 10:10:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-07 10:10:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2019-09-07 10:10:34,240 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 107 [2019-09-07 10:10:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:10:34,240 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2019-09-07 10:10:34,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:10:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2019-09-07 10:10:34,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-07 10:10:34,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:10:34,242 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 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:10:34,243 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:10:34,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:10:34,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1494923494, now seen corresponding path program 11 times [2019-09-07 10:10:34,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:10:34,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:10:34,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:10:34,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:10:34,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:10:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:10:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-09-07 10:10:34,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:10:34,513 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:10:34,528 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:11:23,956 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-07 10:11:23,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:11:24,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:11:24,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:11:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-09-07 10:11:24,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:11:24,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 10:11:24,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:11:24,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:11:24,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:11:24,072 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 15 states. [2019-09-07 10:11:24,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:11:24,310 INFO L93 Difference]: Finished difference Result 230 states and 253 transitions. [2019-09-07 10:11:24,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:11:24,312 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2019-09-07 10:11:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:11:24,312 INFO L225 Difference]: With dead ends: 230 [2019-09-07 10:11:24,313 INFO L226 Difference]: Without dead ends: 128 [2019-09-07 10:11:24,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:11:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-07 10:11:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-09-07 10:11:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-07 10:11:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2019-09-07 10:11:24,328 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 115 [2019-09-07 10:11:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:11:24,328 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2019-09-07 10:11:24,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:11:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2019-09-07 10:11:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-07 10:11:24,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:11:24,330 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 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:11:24,330 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:11:24,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:11:24,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1418922270, now seen corresponding path program 12 times [2019-09-07 10:11:24,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:11:24,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:11:24,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:11:24,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:11:24,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:11:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:11:24,556 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2019-09-07 10:11:24,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:11:24,558 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:11:24,573 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:12:02,506 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 10:12:02,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:12:02,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:12:02,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:12:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2019-09-07 10:12:02,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:12:02,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 10:12:02,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 10:12:02,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 10:12:02,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:12:02,609 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 16 states. [2019-09-07 10:12:02,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:12:02,899 INFO L93 Difference]: Finished difference Result 245 states and 268 transitions. [2019-09-07 10:12:02,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:12:02,900 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 123 [2019-09-07 10:12:02,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:12:02,901 INFO L225 Difference]: With dead ends: 245 [2019-09-07 10:12:02,901 INFO L226 Difference]: Without dead ends: 136 [2019-09-07 10:12:02,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 123 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:12:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-07 10:12:02,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-09-07 10:12:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-07 10:12:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2019-09-07 10:12:02,910 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 123 [2019-09-07 10:12:02,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:12:02,910 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2019-09-07 10:12:02,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 10:12:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2019-09-07 10:12:02,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-07 10:12:02,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:12:02,912 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 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:12:02,912 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:12:02,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:12:02,913 INFO L82 PathProgramCache]: Analyzing trace with hash -545231462, now seen corresponding path program 13 times [2019-09-07 10:12:02,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:12:02,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:12:02,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:12:02,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:12:02,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:12:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:12:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-09-07 10:12:03,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:12:03,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:12:03,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:12:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:12:03,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:12:03,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:12:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-09-07 10:12:03,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:12:03,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 10:12:03,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:12:03,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:12:03,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:12:03,244 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 17 states. [2019-09-07 10:12:03,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:12:03,525 INFO L93 Difference]: Finished difference Result 260 states and 283 transitions. [2019-09-07 10:12:03,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:12:03,526 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 131 [2019-09-07 10:12:03,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:12:03,528 INFO L225 Difference]: With dead ends: 260 [2019-09-07 10:12:03,528 INFO L226 Difference]: Without dead ends: 144 [2019-09-07 10:12:03,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 131 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:12:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-07 10:12:03,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-09-07 10:12:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-07 10:12:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2019-09-07 10:12:03,544 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 131 [2019-09-07 10:12:03,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:12:03,544 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2019-09-07 10:12:03,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:12:03,544 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2019-09-07 10:12:03,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-07 10:12:03,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:12:03,547 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 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:12:03,548 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:12:03,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:12:03,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2020285342, now seen corresponding path program 14 times [2019-09-07 10:12:03,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:12:03,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:12:03,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:12:03,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:12:03,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:12:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:12:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-09-07 10:12:03,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:12:03,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:12:03,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:12:03,938 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:12:03,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:12:03,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:12:03,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:12:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-09-07 10:12:03,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:12:03,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 10:12:03,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 10:12:03,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 10:12:03,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:12:03,986 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 18 states. [2019-09-07 10:12:04,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:12:04,306 INFO L93 Difference]: Finished difference Result 275 states and 298 transitions. [2019-09-07 10:12:04,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 10:12:04,306 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 139 [2019-09-07 10:12:04,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:12:04,307 INFO L225 Difference]: With dead ends: 275 [2019-09-07 10:12:04,307 INFO L226 Difference]: Without dead ends: 152 [2019-09-07 10:12:04,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:12:04,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-07 10:12:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-09-07 10:12:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-07 10:12:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 160 transitions. [2019-09-07 10:12:04,314 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 160 transitions. Word has length 139 [2019-09-07 10:12:04,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:12:04,314 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 160 transitions. [2019-09-07 10:12:04,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 10:12:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2019-09-07 10:12:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-07 10:12:04,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:12:04,319 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 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:12:04,319 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:12:04,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:12:04,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1618430950, now seen corresponding path program 15 times [2019-09-07 10:12:04,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:12:04,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:12:04,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:12:04,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:12:04,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:12:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:12:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-07 10:12:04,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:12:04,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:12:04,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:13:02,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-07 10:13:02,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:13:02,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 10:13:02,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:13:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-07 10:13:02,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:13:02,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 10:13:02,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 10:13:02,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 10:13:02,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:13:02,721 INFO L87 Difference]: Start difference. First operand 152 states and 160 transitions. Second operand 19 states. [2019-09-07 10:13:03,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:03,061 INFO L93 Difference]: Finished difference Result 290 states and 313 transitions. [2019-09-07 10:13:03,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 10:13:03,062 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 147 [2019-09-07 10:13:03,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:03,063 INFO L225 Difference]: With dead ends: 290 [2019-09-07 10:13:03,063 INFO L226 Difference]: Without dead ends: 160 [2019-09-07 10:13:03,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:13:03,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-07 10:13:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-09-07 10:13:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-07 10:13:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2019-09-07 10:13:03,072 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 147 [2019-09-07 10:13:03,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:03,072 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2019-09-07 10:13:03,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 10:13:03,072 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2019-09-07 10:13:03,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-07 10:13:03,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:03,074 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 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:13:03,075 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:03,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:03,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1384746526, now seen corresponding path program 16 times [2019-09-07 10:13:03,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:03,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:03,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:03,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:13:03,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-09-07 10:13:03,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:13:03,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:13:03,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:13:03,533 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:13:03,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:13:03,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:13:03,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:13:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-09-07 10:13:03,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:13:03,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 10:13:03,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 10:13:03,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 10:13:03,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:13:03,593 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand 20 states. [2019-09-07 10:13:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:13:03,910 INFO L93 Difference]: Finished difference Result 305 states and 328 transitions. [2019-09-07 10:13:03,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:13:03,912 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 155 [2019-09-07 10:13:03,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:13:03,913 INFO L225 Difference]: With dead ends: 305 [2019-09-07 10:13:03,914 INFO L226 Difference]: Without dead ends: 168 [2019-09-07 10:13:03,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:13:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-07 10:13:03,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-09-07 10:13:03,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-07 10:13:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 176 transitions. [2019-09-07 10:13:03,922 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 176 transitions. Word has length 155 [2019-09-07 10:13:03,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:13:03,922 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 176 transitions. [2019-09-07 10:13:03,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 10:13:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 176 transitions. [2019-09-07 10:13:03,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-07 10:13:03,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:13:03,925 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 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:13:03,925 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:13:03,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:13:03,925 INFO L82 PathProgramCache]: Analyzing trace with hash -56747366, now seen corresponding path program 17 times [2019-09-07 10:13:03,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:13:03,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:13:03,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:03,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:13:03,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:13:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:13:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1224 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 1071 trivial. 0 not checked. [2019-09-07 10:13:04,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:13:04,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:13:04,286 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:32,424 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-07 10:14:32,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:14:32,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:14:32,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:14:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1224 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 1071 trivial. 0 not checked. [2019-09-07 10:14:32,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:14:32,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 10:14:32,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:14:32,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:14:32,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:14:32,585 INFO L87 Difference]: Start difference. First operand 168 states and 176 transitions. Second operand 21 states. [2019-09-07 10:14:32,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:14:32,882 INFO L93 Difference]: Finished difference Result 320 states and 343 transitions. [2019-09-07 10:14:32,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 10:14:32,882 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 163 [2019-09-07 10:14:32,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:14:32,885 INFO L225 Difference]: With dead ends: 320 [2019-09-07 10:14:32,885 INFO L226 Difference]: Without dead ends: 176 [2019-09-07 10:14:32,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:14:32,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-07 10:14:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-09-07 10:14:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-07 10:14:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 184 transitions. [2019-09-07 10:14:32,893 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 184 transitions. Word has length 163 [2019-09-07 10:14:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:14:32,893 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 184 transitions. [2019-09-07 10:14:32,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:14:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 184 transitions. [2019-09-07 10:14:32,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-07 10:14:32,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:14:32,895 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 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:14:32,896 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:14:32,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:14:32,896 INFO L82 PathProgramCache]: Analyzing trace with hash -909221730, now seen corresponding path program 18 times [2019-09-07 10:14:32,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:14:32,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:14:32,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:32,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:14:32,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:14:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:14:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1368 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 1197 trivial. 0 not checked. [2019-09-07 10:14:33,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:14:33,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:14:33,279 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:15:48,009 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-07 10:15:48,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:48,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 10:15:48,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1368 backedges. 18 proven. 171 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-09-07 10:15:48,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:48,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 23 [2019-09-07 10:15:48,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:15:48,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:15:48,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:15:48,188 INFO L87 Difference]: Start difference. First operand 176 states and 184 transitions. Second operand 23 states. [2019-09-07 10:15:48,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:48,745 INFO L93 Difference]: Finished difference Result 335 states and 358 transitions. [2019-09-07 10:15:48,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 10:15:48,746 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 171 [2019-09-07 10:15:48,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:48,748 INFO L225 Difference]: With dead ends: 335 [2019-09-07 10:15:48,748 INFO L226 Difference]: Without dead ends: 184 [2019-09-07 10:15:48,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:15:48,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-07 10:15:48,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-09-07 10:15:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-07 10:15:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 192 transitions. [2019-09-07 10:15:48,767 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 192 transitions. Word has length 171 [2019-09-07 10:15:48,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:48,767 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 192 transitions. [2019-09-07 10:15:48,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:15:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 192 transitions. [2019-09-07 10:15:48,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-07 10:15:48,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:48,772 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 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:15:48,773 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:48,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:48,773 INFO L82 PathProgramCache]: Analyzing trace with hash 710975770, now seen corresponding path program 19 times [2019-09-07 10:15:48,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:48,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:48,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:48,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:48,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2019-09-07 10:15:49,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:49,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:49,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:15:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:49,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:15:49,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2019-09-07 10:15:49,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:49,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 10:15:49,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:15:49,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:15:49,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:15:49,284 INFO L87 Difference]: Start difference. First operand 184 states and 192 transitions. Second operand 23 states. [2019-09-07 10:15:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:49,695 INFO L93 Difference]: Finished difference Result 350 states and 373 transitions. [2019-09-07 10:15:49,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 10:15:49,697 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 179 [2019-09-07 10:15:49,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:49,699 INFO L225 Difference]: With dead ends: 350 [2019-09-07 10:15:49,699 INFO L226 Difference]: Without dead ends: 192 [2019-09-07 10:15:49,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:15:49,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-07 10:15:49,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-09-07 10:15:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-07 10:15:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 200 transitions. [2019-09-07 10:15:49,709 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 200 transitions. Word has length 179 [2019-09-07 10:15:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:49,709 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 200 transitions. [2019-09-07 10:15:49,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:15:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 200 transitions. [2019-09-07 10:15:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-07 10:15:49,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:49,712 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 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:15:49,712 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:49,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:49,713 INFO L82 PathProgramCache]: Analyzing trace with hash -954625250, now seen corresponding path program 20 times [2019-09-07 10:15:49,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:49,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:49,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:49,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:15:49,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1470 trivial. 0 not checked. [2019-09-07 10:15:50,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:50,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:15:50,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:50,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:15:50,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:15:50,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:15:50,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:15:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1470 trivial. 0 not checked. [2019-09-07 10:15:50,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:15:50,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 10:15:50,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 10:15:50,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 10:15:50,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:15:50,356 INFO L87 Difference]: Start difference. First operand 192 states and 200 transitions. Second operand 24 states. [2019-09-07 10:15:50,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:15:50,712 INFO L93 Difference]: Finished difference Result 365 states and 388 transitions. [2019-09-07 10:15:50,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:15:50,713 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 187 [2019-09-07 10:15:50,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:15:50,714 INFO L225 Difference]: With dead ends: 365 [2019-09-07 10:15:50,715 INFO L226 Difference]: Without dead ends: 200 [2019-09-07 10:15:50,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:15:50,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-07 10:15:50,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-09-07 10:15:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-07 10:15:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 208 transitions. [2019-09-07 10:15:50,728 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 208 transitions. Word has length 187 [2019-09-07 10:15:50,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:15:50,728 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 208 transitions. [2019-09-07 10:15:50,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 10:15:50,729 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 208 transitions. [2019-09-07 10:15:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-07 10:15:50,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:15:50,730 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 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:15:50,730 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:15:50,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:15:50,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2054178714, now seen corresponding path program 21 times [2019-09-07 10:15:50,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:15:50,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:15:50,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:50,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:15:50,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:15:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:15:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1848 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-07 10:15:51,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:15:51,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:15:51,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:17:24,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-07 10:17:24,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:17:24,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 10:17:24,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:17:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1848 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-07 10:17:24,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:17:24,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 10:17:24,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:17:24,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:17:24,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:17:24,863 INFO L87 Difference]: Start difference. First operand 200 states and 208 transitions. Second operand 25 states. [2019-09-07 10:17:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:17:25,249 INFO L93 Difference]: Finished difference Result 380 states and 403 transitions. [2019-09-07 10:17:25,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 10:17:25,257 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 195 [2019-09-07 10:17:25,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:17:25,258 INFO L225 Difference]: With dead ends: 380 [2019-09-07 10:17:25,258 INFO L226 Difference]: Without dead ends: 208 [2019-09-07 10:17:25,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:17:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-07 10:17:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-09-07 10:17:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-07 10:17:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 216 transitions. [2019-09-07 10:17:25,268 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 216 transitions. Word has length 195 [2019-09-07 10:17:25,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:17:25,268 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 216 transitions. [2019-09-07 10:17:25,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:17:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 216 transitions. [2019-09-07 10:17:25,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-07 10:17:25,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:17:25,270 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 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:17:25,270 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:17:25,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:17:25,271 INFO L82 PathProgramCache]: Analyzing trace with hash 894117278, now seen corresponding path program 22 times [2019-09-07 10:17:25,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:17:25,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:17:25,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:25,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:17:25,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:17:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2024 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1771 trivial. 0 not checked. [2019-09-07 10:17:25,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:17:25,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:17:25,693 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:17:25,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:17:25,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:17:25,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:17:25,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:17:25,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2024 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1771 trivial. 0 not checked. [2019-09-07 10:17:25,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:17:25,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 10:17:25,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 10:17:25,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 10:17:25,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:17:25,871 INFO L87 Difference]: Start difference. First operand 208 states and 216 transitions. Second operand 26 states. [2019-09-07 10:17:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:17:26,301 INFO L93 Difference]: Finished difference Result 395 states and 418 transitions. [2019-09-07 10:17:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 10:17:26,302 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 203 [2019-09-07 10:17:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:17:26,303 INFO L225 Difference]: With dead ends: 395 [2019-09-07 10:17:26,303 INFO L226 Difference]: Without dead ends: 216 [2019-09-07 10:17:26,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:17:26,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-07 10:17:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-09-07 10:17:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-07 10:17:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 224 transitions. [2019-09-07 10:17:26,310 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 224 transitions. Word has length 203 [2019-09-07 10:17:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:17:26,310 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 224 transitions. [2019-09-07 10:17:26,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 10:17:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 224 transitions. [2019-09-07 10:17:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-07 10:17:26,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:17:26,312 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 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:17:26,313 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:17:26,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:17:26,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1550650906, now seen corresponding path program 23 times [2019-09-07 10:17:26,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:17:26,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:17:26,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:26,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:17:26,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:17:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:17:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2208 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 1932 trivial. 0 not checked. [2019-09-07 10:17:26,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:17:26,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:17:26,719 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:19:28,837 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-07 10:19:28,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:19:28,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:19:28,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:19:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2208 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 1932 trivial. 0 not checked. [2019-09-07 10:19:28,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:19:28,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 10:19:28,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:19:28,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:19:28,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:19:28,996 INFO L87 Difference]: Start difference. First operand 216 states and 224 transitions. Second operand 27 states. [2019-09-07 10:19:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:19:29,382 INFO L93 Difference]: Finished difference Result 410 states and 433 transitions. [2019-09-07 10:19:29,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 10:19:29,382 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 211 [2019-09-07 10:19:29,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:19:29,386 INFO L225 Difference]: With dead ends: 410 [2019-09-07 10:19:29,386 INFO L226 Difference]: Without dead ends: 224 [2019-09-07 10:19:29,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:19:29,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-07 10:19:29,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-09-07 10:19:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-07 10:19:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 232 transitions. [2019-09-07 10:19:29,397 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 232 transitions. Word has length 211 [2019-09-07 10:19:29,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:19:29,397 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 232 transitions. [2019-09-07 10:19:29,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:19:29,398 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 232 transitions. [2019-09-07 10:19:29,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-07 10:19:29,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:19:29,399 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 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:19:29,400 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:19:29,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:19:29,400 INFO L82 PathProgramCache]: Analyzing trace with hash 21174302, now seen corresponding path program 24 times [2019-09-07 10:19:29,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:19:29,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:19:29,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:29,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:19:29,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:19:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:19:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2400 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 2100 trivial. 0 not checked. [2019-09-07 10:19:29,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:19:29,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:19:30,005 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:21:20,621 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 10:21:20,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:21:20,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 10:21:20,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2400 backedges. 24 proven. 300 refuted. 0 times theorem prover too weak. 2076 trivial. 0 not checked. [2019-09-07 10:21:20,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:20,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 29 [2019-09-07 10:21:20,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:21:20,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:21:20,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:21:20,823 INFO L87 Difference]: Start difference. First operand 224 states and 232 transitions. Second operand 29 states. [2019-09-07 10:21:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:21,366 INFO L93 Difference]: Finished difference Result 425 states and 448 transitions. [2019-09-07 10:21:21,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:21:21,367 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 219 [2019-09-07 10:21:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:21,368 INFO L225 Difference]: With dead ends: 425 [2019-09-07 10:21:21,369 INFO L226 Difference]: Without dead ends: 232 [2019-09-07 10:21:21,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:21:21,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-07 10:21:21,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-09-07 10:21:21,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-07 10:21:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 240 transitions. [2019-09-07 10:21:21,380 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 240 transitions. Word has length 219 [2019-09-07 10:21:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:21,380 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 240 transitions. [2019-09-07 10:21:21,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:21:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 240 transitions. [2019-09-07 10:21:21,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-07 10:21:21,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:21,384 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 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:21:21,384 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:21,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:21,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1576465562, now seen corresponding path program 25 times [2019-09-07 10:21:21,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:21,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:21,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:21,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:21:21,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2600 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 2275 trivial. 0 not checked. [2019-09-07 10:21:21,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:21,948 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:21:21,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:21:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:22,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:21:22,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2600 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 2275 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:21:22,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:22,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 10:21:22,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:21:22,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:21:22,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:21:22,171 INFO L87 Difference]: Start difference. First operand 232 states and 240 transitions. Second operand 29 states. [2019-09-07 10:21:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:22,692 INFO L93 Difference]: Finished difference Result 440 states and 463 transitions. [2019-09-07 10:21:22,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:21:22,694 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 227 [2019-09-07 10:21:22,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:22,696 INFO L225 Difference]: With dead ends: 440 [2019-09-07 10:21:22,696 INFO L226 Difference]: Without dead ends: 240 [2019-09-07 10:21:22,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:21:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-07 10:21:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2019-09-07 10:21:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-07 10:21:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 248 transitions. [2019-09-07 10:21:22,704 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 248 transitions. Word has length 227 [2019-09-07 10:21:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:22,705 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 248 transitions. [2019-09-07 10:21:22,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:21:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 248 transitions. [2019-09-07 10:21:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-07 10:21:22,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:22,707 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 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:21:22,707 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:22,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash 434203294, now seen corresponding path program 26 times [2019-09-07 10:21:22,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:22,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:22,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:22,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:21:22,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2808 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 2457 trivial. 0 not checked. [2019-09-07 10:21:23,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:23,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:21:23,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:21:23,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:21:23,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:21:23,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:21:23,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2808 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 2457 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:21:23,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:23,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 10:21:23,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 10:21:23,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 10:21:23,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:21:23,560 INFO L87 Difference]: Start difference. First operand 240 states and 248 transitions. Second operand 30 states. [2019-09-07 10:21:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:24,053 INFO L93 Difference]: Finished difference Result 455 states and 478 transitions. [2019-09-07 10:21:24,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 10:21:24,053 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 235 [2019-09-07 10:21:24,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:24,056 INFO L225 Difference]: With dead ends: 455 [2019-09-07 10:21:24,056 INFO L226 Difference]: Without dead ends: 248 [2019-09-07 10:21:24,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:21:24,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-07 10:21:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-09-07 10:21:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-07 10:21:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 256 transitions. [2019-09-07 10:21:24,067 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 256 transitions. Word has length 235 [2019-09-07 10:21:24,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:24,067 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 256 transitions. [2019-09-07 10:21:24,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 10:21:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 256 transitions. [2019-09-07 10:21:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-07 10:21:24,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:24,070 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 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:21:24,070 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:24,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:24,070 INFO L82 PathProgramCache]: Analyzing trace with hash 716045082, now seen corresponding path program 27 times [2019-09-07 10:21:24,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:24,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:24,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:24,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:21:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3024 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2646 trivial. 0 not checked. [2019-09-07 10:21:24,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:24,933 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:21:24,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:23:37,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-07 10:23:37,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:23:37,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:23:37,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:23:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3024 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2646 trivial. 0 not checked. [2019-09-07 10:23:37,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:23:37,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 10:23:37,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:23:37,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:23:37,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:23:37,564 INFO L87 Difference]: Start difference. First operand 248 states and 256 transitions. Second operand 31 states. [2019-09-07 10:23:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:23:38,067 INFO L93 Difference]: Finished difference Result 470 states and 493 transitions. [2019-09-07 10:23:38,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 10:23:38,067 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 243 [2019-09-07 10:23:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:23:38,069 INFO L225 Difference]: With dead ends: 470 [2019-09-07 10:23:38,070 INFO L226 Difference]: Without dead ends: 256 [2019-09-07 10:23:38,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:23:38,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-09-07 10:23:38,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2019-09-07 10:23:38,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-07 10:23:38,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 264 transitions. [2019-09-07 10:23:38,079 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 264 transitions. Word has length 243 [2019-09-07 10:23:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:23:38,080 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 264 transitions. [2019-09-07 10:23:38,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:23:38,080 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 264 transitions. [2019-09-07 10:23:38,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-07 10:23:38,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:23:38,081 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 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:23:38,082 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:23:38,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:23:38,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1879448862, now seen corresponding path program 28 times [2019-09-07 10:23:38,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:23:38,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:23:38,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:23:38,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:23:38,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:23:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:23:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3248 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 2842 trivial. 0 not checked. [2019-09-07 10:23:38,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:23:38,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:23:38,842 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:23:38,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:23:38,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:23:39,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 10:23:39,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:23:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3248 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 2842 trivial. 0 not checked. [2019-09-07 10:23:39,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:23:39,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-07 10:23:39,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 10:23:39,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 10:23:39,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:23:39,068 INFO L87 Difference]: Start difference. First operand 256 states and 264 transitions. Second operand 32 states. [2019-09-07 10:23:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:23:39,588 INFO L93 Difference]: Finished difference Result 485 states and 508 transitions. [2019-09-07 10:23:39,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 10:23:39,589 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 251 [2019-09-07 10:23:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:23:39,590 INFO L225 Difference]: With dead ends: 485 [2019-09-07 10:23:39,591 INFO L226 Difference]: Without dead ends: 264 [2019-09-07 10:23:39,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:23:39,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-07 10:23:39,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2019-09-07 10:23:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-07 10:23:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 272 transitions. [2019-09-07 10:23:39,601 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 272 transitions. Word has length 251 [2019-09-07 10:23:39,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:23:39,601 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 272 transitions. [2019-09-07 10:23:39,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 10:23:39,601 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 272 transitions. [2019-09-07 10:23:39,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-07 10:23:39,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:23:39,603 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 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:23:39,603 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:23:39,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:23:39,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1942871654, now seen corresponding path program 29 times [2019-09-07 10:23:39,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:23:39,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:23:39,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:23:39,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:23:39,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:23:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:23:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 3045 trivial. 0 not checked. [2019-09-07 10:23:40,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:23:40,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:23:40,169 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1