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/loop-lit/gj2007.c.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:52:28,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:52:28,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:52:28,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:52:28,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:52:28,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:52:28,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:52:28,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:52:28,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:52:28,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:52:28,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:52:28,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:52:28,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:52:28,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:52:28,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:52:28,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:52:28,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:52:28,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:52:28,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:52:28,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:52:28,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:52:28,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:52:28,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:52:28,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:52:28,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:52:28,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:52:28,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:52:28,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:52:28,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:52:28,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:52:28,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:52:28,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:52:28,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:52:28,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:52:28,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:52:28,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:52:28,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:52:28,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:52:28,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:52:28,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:52:28,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:52:28,120 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-03 19:52:28,135 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:52:28,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:52:28,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:52:28,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:52:28,137 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:52:28,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:52:28,137 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:52:28,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:52:28,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:52:28,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:52:28,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:52:28,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:52:28,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:52:28,138 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:52:28,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:52:28,139 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:52:28,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:52:28,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:52:28,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:52:28,140 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:52:28,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:52:28,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:52:28,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:52:28,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:52:28,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:52:28,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:52:28,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:52:28,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:52:28,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:52:28,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:52:28,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:52:28,192 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:52:28,194 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:52:28,194 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:52:28,195 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-09-03 19:52:28,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3a2843f/9b0815aee68a4673912acabbb355240d/FLAG04ee4ab9d [2019-09-03 19:52:28,736 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:52:28,737 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-09-03 19:52:28,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3a2843f/9b0815aee68a4673912acabbb355240d/FLAG04ee4ab9d [2019-09-03 19:52:29,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3a2843f/9b0815aee68a4673912acabbb355240d [2019-09-03 19:52:29,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:52:29,288 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:52:29,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:52:29,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:52:29,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:52:29,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:52:29" (1/1) ... [2019-09-03 19:52:29,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6595b9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:29, skipping insertion in model container [2019-09-03 19:52:29,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:52:29" (1/1) ... [2019-09-03 19:52:29,304 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:52:29,348 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:52:29,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:52:29,713 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:52:29,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:52:29,924 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:52:29,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:29 WrapperNode [2019-09-03 19:52:29,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:52:29,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:52:29,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:52:29,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:52:29,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:29" (1/1) ... [2019-09-03 19:52:29,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:29" (1/1) ... [2019-09-03 19:52:29,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:29" (1/1) ... [2019-09-03 19:52:29,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:29" (1/1) ... [2019-09-03 19:52:29,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:29" (1/1) ... [2019-09-03 19:52:30,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:29" (1/1) ... [2019-09-03 19:52:30,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:29" (1/1) ... [2019-09-03 19:52:30,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:52:30,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:52:30,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:52:30,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:52:30,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:29" (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-03 19:52:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:52:30,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:52:30,097 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:52:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:52:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:52:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:52:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:52:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:52:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:52:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:52:30,946 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:52:30,946 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 19:52:30,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:52:30 BoogieIcfgContainer [2019-09-03 19:52:30,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:52:30,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:52:30,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:52:30,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:52:30,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:52:29" (1/3) ... [2019-09-03 19:52:30,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acfbde5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:52:30, skipping insertion in model container [2019-09-03 19:52:30,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:52:29" (2/3) ... [2019-09-03 19:52:30,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acfbde5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:52:30, skipping insertion in model container [2019-09-03 19:52:30,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:52:30" (3/3) ... [2019-09-03 19:52:30,960 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2019-09-03 19:52:30,971 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:52:30,980 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:52:30,997 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:52:31,032 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:52:31,033 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:52:31,033 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:52:31,033 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:52:31,033 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:52:31,033 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:52:31,034 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:52:31,034 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:52:31,034 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:52:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-09-03 19:52:31,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:31,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:31,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:31,078 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:31,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:31,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1537709744, now seen corresponding path program 1 times [2019-09-03 19:52:31,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:31,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:31,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:31,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:31,317 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-03 19:52:31,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:31,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:52:31,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:52:31,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:52:31,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:52:31,347 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2019-09-03 19:52:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:31,884 INFO L93 Difference]: Finished difference Result 290 states and 560 transitions. [2019-09-03 19:52:31,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:52:31,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-03 19:52:31,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:31,901 INFO L225 Difference]: With dead ends: 290 [2019-09-03 19:52:31,901 INFO L226 Difference]: Without dead ends: 145 [2019-09-03 19:52:31,906 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-03 19:52:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-03 19:52:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-09-03 19:52:31,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-03 19:52:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-09-03 19:52:31,979 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 143 [2019-09-03 19:52:31,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:31,980 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-09-03 19:52:31,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:52:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-09-03 19:52:31,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:31,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:31,992 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:31,992 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:31,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:31,993 INFO L82 PathProgramCache]: Analyzing trace with hash 470480343, now seen corresponding path program 1 times [2019-09-03 19:52:31,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:31,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:31,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:31,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:31,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:32,150 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-03 19:52:32,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:32,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:52:32,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:52:32,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:52:32,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:52:32,156 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-09-03 19:52:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:32,709 INFO L93 Difference]: Finished difference Result 410 states and 609 transitions. [2019-09-03 19:52:32,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:52:32,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-03 19:52:32,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:32,714 INFO L225 Difference]: With dead ends: 410 [2019-09-03 19:52:32,714 INFO L226 Difference]: Without dead ends: 277 [2019-09-03 19:52:32,716 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-03 19:52:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-03 19:52:32,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2019-09-03 19:52:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-03 19:52:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 345 transitions. [2019-09-03 19:52:32,740 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 345 transitions. Word has length 143 [2019-09-03 19:52:32,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:32,740 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 345 transitions. [2019-09-03 19:52:32,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:52:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 345 transitions. [2019-09-03 19:52:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:32,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:32,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:32,744 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:32,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:32,744 INFO L82 PathProgramCache]: Analyzing trace with hash 859387544, now seen corresponding path program 1 times [2019-09-03 19:52:32,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:32,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:32,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:32,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:32,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:32,960 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-03 19:52:32,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:32,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 19:52:32,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:52:32,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:52:32,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:52:32,962 INFO L87 Difference]: Start difference. First operand 277 states and 345 transitions. Second operand 7 states. [2019-09-03 19:52:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:33,695 INFO L93 Difference]: Finished difference Result 404 states and 472 transitions. [2019-09-03 19:52:33,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:52:33,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-03 19:52:33,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:33,698 INFO L225 Difference]: With dead ends: 404 [2019-09-03 19:52:33,698 INFO L226 Difference]: Without dead ends: 269 [2019-09-03 19:52:33,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:52:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-03 19:52:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-09-03 19:52:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-03 19:52:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2019-09-03 19:52:33,720 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 143 [2019-09-03 19:52:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:33,721 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2019-09-03 19:52:33,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:52:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2019-09-03 19:52:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:33,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:33,723 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:33,724 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:33,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:33,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1284631305, now seen corresponding path program 1 times [2019-09-03 19:52:33,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:33,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:33,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:33,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:33,834 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-03 19:52:33,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:33,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-03 19:52:33,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:52:33,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:52:33,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:52:33,836 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 8 states. [2019-09-03 19:52:34,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:34,669 INFO L93 Difference]: Finished difference Result 394 states and 458 transitions. [2019-09-03 19:52:34,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:52:34,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 143 [2019-09-03 19:52:34,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:34,674 INFO L225 Difference]: With dead ends: 394 [2019-09-03 19:52:34,674 INFO L226 Difference]: Without dead ends: 267 [2019-09-03 19:52:34,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:52:34,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-03 19:52:34,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2019-09-03 19:52:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-03 19:52:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 330 transitions. [2019-09-03 19:52:34,713 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 330 transitions. Word has length 143 [2019-09-03 19:52:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:34,714 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 330 transitions. [2019-09-03 19:52:34,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:52:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 330 transitions. [2019-09-03 19:52:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:34,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:34,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:34,721 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:34,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:34,722 INFO L82 PathProgramCache]: Analyzing trace with hash 698919756, now seen corresponding path program 1 times [2019-09-03 19:52:34,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:34,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:34,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:34,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:34,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:34,907 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-03 19:52:34,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:34,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-03 19:52:34,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:52:34,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:52:34,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:52:34,909 INFO L87 Difference]: Start difference. First operand 267 states and 330 transitions. Second operand 9 states. [2019-09-03 19:52:35,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:35,463 INFO L93 Difference]: Finished difference Result 390 states and 453 transitions. [2019-09-03 19:52:35,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:52:35,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 143 [2019-09-03 19:52:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:35,467 INFO L225 Difference]: With dead ends: 390 [2019-09-03 19:52:35,467 INFO L226 Difference]: Without dead ends: 265 [2019-09-03 19:52:35,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:52:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-09-03 19:52:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2019-09-03 19:52:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-03 19:52:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2019-09-03 19:52:35,481 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 143 [2019-09-03 19:52:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:35,481 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2019-09-03 19:52:35,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:52:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2019-09-03 19:52:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:35,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:35,484 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:35,484 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:35,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:35,484 INFO L82 PathProgramCache]: Analyzing trace with hash 2054450191, now seen corresponding path program 1 times [2019-09-03 19:52:35,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:35,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:35,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:35,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:35,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:35,659 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-03 19:52:35,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:35,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-03 19:52:35,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:52:35,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:52:35,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:52:35,661 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand 12 states. [2019-09-03 19:52:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:35,994 INFO L93 Difference]: Finished difference Result 382 states and 444 transitions. [2019-09-03 19:52:35,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:52:35,995 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2019-09-03 19:52:35,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:35,997 INFO L225 Difference]: With dead ends: 382 [2019-09-03 19:52:35,997 INFO L226 Difference]: Without dead ends: 259 [2019-09-03 19:52:35,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:52:35,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-03 19:52:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-09-03 19:52:36,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-03 19:52:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 318 transitions. [2019-09-03 19:52:36,009 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 318 transitions. Word has length 143 [2019-09-03 19:52:36,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:36,011 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 318 transitions. [2019-09-03 19:52:36,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:52:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 318 transitions. [2019-09-03 19:52:36,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:36,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:36,013 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:36,013 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:36,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:36,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1013609311, now seen corresponding path program 1 times [2019-09-03 19:52:36,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:36,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:36,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:36,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:36,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:36,284 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-03 19:52:36,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:36,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-03 19:52:36,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:52:36,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:52:36,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:52:36,286 INFO L87 Difference]: Start difference. First operand 259 states and 318 transitions. Second operand 14 states. [2019-09-03 19:52:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:37,630 INFO L93 Difference]: Finished difference Result 372 states and 431 transitions. [2019-09-03 19:52:37,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:52:37,635 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 143 [2019-09-03 19:52:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:37,638 INFO L225 Difference]: With dead ends: 372 [2019-09-03 19:52:37,639 INFO L226 Difference]: Without dead ends: 255 [2019-09-03 19:52:37,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:52:37,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-03 19:52:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-09-03 19:52:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-03 19:52:37,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2019-09-03 19:52:37,648 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 143 [2019-09-03 19:52:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:37,648 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2019-09-03 19:52:37,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:52:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2019-09-03 19:52:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:37,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:37,651 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:37,651 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:37,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:37,651 INFO L82 PathProgramCache]: Analyzing trace with hash 560132216, now seen corresponding path program 1 times [2019-09-03 19:52:37,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:37,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:37,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:37,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:37,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:37,808 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-03 19:52:37,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:37,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-03 19:52:37,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:52:37,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:52:37,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:52:37,810 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand 15 states. [2019-09-03 19:52:38,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:38,412 INFO L93 Difference]: Finished difference Result 366 states and 423 transitions. [2019-09-03 19:52:38,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:52:38,413 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 143 [2019-09-03 19:52:38,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:38,415 INFO L225 Difference]: With dead ends: 366 [2019-09-03 19:52:38,416 INFO L226 Difference]: Without dead ends: 253 [2019-09-03 19:52:38,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:52:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-03 19:52:38,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2019-09-03 19:52:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-03 19:52:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2019-09-03 19:52:38,425 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 143 [2019-09-03 19:52:38,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:38,426 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2019-09-03 19:52:38,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:52:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2019-09-03 19:52:38,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:38,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:38,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:38,428 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:38,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:38,428 INFO L82 PathProgramCache]: Analyzing trace with hash 752755852, now seen corresponding path program 1 times [2019-09-03 19:52:38,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:38,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:38,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:38,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:38,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:38,613 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-03 19:52:38,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:38,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-03 19:52:38,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:52:38,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:52:38,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:52:38,616 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand 17 states. [2019-09-03 19:52:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:40,170 INFO L93 Difference]: Finished difference Result 360 states and 416 transitions. [2019-09-03 19:52:40,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:52:40,170 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 143 [2019-09-03 19:52:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:40,173 INFO L225 Difference]: With dead ends: 360 [2019-09-03 19:52:40,173 INFO L226 Difference]: Without dead ends: 249 [2019-09-03 19:52:40,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:52:40,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-09-03 19:52:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-09-03 19:52:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-03 19:52:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 303 transitions. [2019-09-03 19:52:40,183 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 303 transitions. Word has length 143 [2019-09-03 19:52:40,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:40,183 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 303 transitions. [2019-09-03 19:52:40,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:52:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 303 transitions. [2019-09-03 19:52:40,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:40,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:40,185 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:40,185 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:40,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:40,186 INFO L82 PathProgramCache]: Analyzing trace with hash -553376648, now seen corresponding path program 1 times [2019-09-03 19:52:40,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:40,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:40,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:40,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:40,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:40,372 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-03 19:52:40,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:40,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-03 19:52:40,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:52:40,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:52:40,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:52:40,375 INFO L87 Difference]: Start difference. First operand 249 states and 303 transitions. Second operand 19 states. [2019-09-03 19:52:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:42,190 INFO L93 Difference]: Finished difference Result 352 states and 406 transitions. [2019-09-03 19:52:42,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:52:42,193 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 143 [2019-09-03 19:52:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:42,195 INFO L225 Difference]: With dead ends: 352 [2019-09-03 19:52:42,195 INFO L226 Difference]: Without dead ends: 245 [2019-09-03 19:52:42,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:52:42,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-09-03 19:52:42,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-09-03 19:52:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-03 19:52:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 297 transitions. [2019-09-03 19:52:42,206 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 297 transitions. Word has length 143 [2019-09-03 19:52:42,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:42,206 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 297 transitions. [2019-09-03 19:52:42,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:52:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 297 transitions. [2019-09-03 19:52:42,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:42,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:42,208 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:42,209 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:42,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:42,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1465640920, now seen corresponding path program 1 times [2019-09-03 19:52:42,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:42,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:42,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:42,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:42,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:42,458 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-03 19:52:42,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:42,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-03 19:52:42,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:52:42,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:52:42,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:52:42,460 INFO L87 Difference]: Start difference. First operand 245 states and 297 transitions. Second operand 23 states. [2019-09-03 19:52:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:42,991 INFO L93 Difference]: Finished difference Result 340 states and 392 transitions. [2019-09-03 19:52:42,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:52:42,992 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 143 [2019-09-03 19:52:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:42,994 INFO L225 Difference]: With dead ends: 340 [2019-09-03 19:52:42,995 INFO L226 Difference]: Without dead ends: 237 [2019-09-03 19:52:42,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:52:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-03 19:52:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-09-03 19:52:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-09-03 19:52:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 285 transitions. [2019-09-03 19:52:43,005 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 285 transitions. Word has length 143 [2019-09-03 19:52:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:43,008 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 285 transitions. [2019-09-03 19:52:43,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:52:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 285 transitions. [2019-09-03 19:52:43,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:43,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:43,010 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:43,010 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:43,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:43,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1149693335, now seen corresponding path program 1 times [2019-09-03 19:52:43,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:43,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:43,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:43,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:43,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:43,323 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-03 19:52:43,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:43,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-03 19:52:43,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:52:43,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:52:43,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:52:43,325 INFO L87 Difference]: Start difference. First operand 237 states and 285 transitions. Second operand 24 states. [2019-09-03 19:52:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:45,427 INFO L93 Difference]: Finished difference Result 330 states and 378 transitions. [2019-09-03 19:52:45,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:52:45,427 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 143 [2019-09-03 19:52:45,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:45,429 INFO L225 Difference]: With dead ends: 330 [2019-09-03 19:52:45,429 INFO L226 Difference]: Without dead ends: 235 [2019-09-03 19:52:45,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:52:45,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-03 19:52:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-09-03 19:52:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-03 19:52:45,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 282 transitions. [2019-09-03 19:52:45,438 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 282 transitions. Word has length 143 [2019-09-03 19:52:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:45,438 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 282 transitions. [2019-09-03 19:52:45,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:52:45,439 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 282 transitions. [2019-09-03 19:52:45,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:45,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:45,440 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:45,440 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:45,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:45,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1452778676, now seen corresponding path program 1 times [2019-09-03 19:52:45,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:45,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:45,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:45,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:45,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:45,717 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-03 19:52:45,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:45,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-03 19:52:45,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:52:45,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:52:45,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:52:45,719 INFO L87 Difference]: Start difference. First operand 235 states and 282 transitions. Second operand 25 states. [2019-09-03 19:52:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:47,823 INFO L93 Difference]: Finished difference Result 326 states and 373 transitions. [2019-09-03 19:52:47,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:52:47,824 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 143 [2019-09-03 19:52:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:47,826 INFO L225 Difference]: With dead ends: 326 [2019-09-03 19:52:47,826 INFO L226 Difference]: Without dead ends: 233 [2019-09-03 19:52:47,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:52:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-09-03 19:52:47,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-09-03 19:52:47,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-03 19:52:47,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 279 transitions. [2019-09-03 19:52:47,835 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 279 transitions. Word has length 143 [2019-09-03 19:52:47,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:47,835 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 279 transitions. [2019-09-03 19:52:47,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:52:47,835 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 279 transitions. [2019-09-03 19:52:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:47,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:47,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:47,837 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:47,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:47,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1738588719, now seen corresponding path program 1 times [2019-09-03 19:52:47,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:47,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:47,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:47,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:47,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:48,260 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-03 19:52:48,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:48,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-03 19:52:48,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:52:48,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:52:48,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:52:48,263 INFO L87 Difference]: Start difference. First operand 233 states and 279 transitions. Second operand 28 states. [2019-09-03 19:52:50,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:50,450 INFO L93 Difference]: Finished difference Result 318 states and 364 transitions. [2019-09-03 19:52:50,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:52:50,451 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 143 [2019-09-03 19:52:50,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:50,453 INFO L225 Difference]: With dead ends: 318 [2019-09-03 19:52:50,453 INFO L226 Difference]: Without dead ends: 227 [2019-09-03 19:52:50,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:52:50,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-03 19:52:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-09-03 19:52:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-03 19:52:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 270 transitions. [2019-09-03 19:52:50,462 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 270 transitions. Word has length 143 [2019-09-03 19:52:50,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:50,462 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 270 transitions. [2019-09-03 19:52:50,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:52:50,462 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 270 transitions. [2019-09-03 19:52:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:50,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:50,464 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:50,464 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:50,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:50,464 INFO L82 PathProgramCache]: Analyzing trace with hash -512972737, now seen corresponding path program 1 times [2019-09-03 19:52:50,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:50,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:50,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:50,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:50,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:50,873 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-03 19:52:50,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:50,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-03 19:52:50,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:52:50,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:52:50,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:52:50,875 INFO L87 Difference]: Start difference. First operand 227 states and 270 transitions. Second operand 30 states. [2019-09-03 19:52:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:51,702 INFO L93 Difference]: Finished difference Result 308 states and 351 transitions. [2019-09-03 19:52:51,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:52:51,702 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 143 [2019-09-03 19:52:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:51,704 INFO L225 Difference]: With dead ends: 308 [2019-09-03 19:52:51,704 INFO L226 Difference]: Without dead ends: 223 [2019-09-03 19:52:51,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:52:51,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-03 19:52:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-09-03 19:52:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-03 19:52:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 264 transitions. [2019-09-03 19:52:51,713 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 264 transitions. Word has length 143 [2019-09-03 19:52:51,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:51,714 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 264 transitions. [2019-09-03 19:52:51,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:52:51,714 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 264 transitions. [2019-09-03 19:52:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:51,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:51,715 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:51,716 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:51,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:51,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1207573688, now seen corresponding path program 1 times [2019-09-03 19:52:51,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:51,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:51,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:51,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:51,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:52,146 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-03 19:52:52,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:52,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-03 19:52:52,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:52:52,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:52:52,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:52:52,149 INFO L87 Difference]: Start difference. First operand 223 states and 264 transitions. Second operand 31 states. [2019-09-03 19:52:54,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:54,609 INFO L93 Difference]: Finished difference Result 302 states and 343 transitions. [2019-09-03 19:52:54,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:52:54,609 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 143 [2019-09-03 19:52:54,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:54,611 INFO L225 Difference]: With dead ends: 302 [2019-09-03 19:52:54,611 INFO L226 Difference]: Without dead ends: 221 [2019-09-03 19:52:54,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:52:54,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-03 19:52:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-09-03 19:52:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-03 19:52:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 261 transitions. [2019-09-03 19:52:54,619 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 261 transitions. Word has length 143 [2019-09-03 19:52:54,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:54,619 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 261 transitions. [2019-09-03 19:52:54,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:52:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 261 transitions. [2019-09-03 19:52:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:54,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:54,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:54,621 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:54,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:54,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1520258956, now seen corresponding path program 1 times [2019-09-03 19:52:54,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:54,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:54,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:54,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:54,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:55,108 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-03 19:52:55,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:55,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-03 19:52:55,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:52:55,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:52:55,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:52:55,112 INFO L87 Difference]: Start difference. First operand 221 states and 261 transitions. Second operand 33 states. [2019-09-03 19:52:57,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:57,566 INFO L93 Difference]: Finished difference Result 296 states and 336 transitions. [2019-09-03 19:52:57,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:52:57,567 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 143 [2019-09-03 19:52:57,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:57,569 INFO L225 Difference]: With dead ends: 296 [2019-09-03 19:52:57,569 INFO L226 Difference]: Without dead ends: 217 [2019-09-03 19:52:57,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:52:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-03 19:52:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-09-03 19:52:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-03 19:52:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 255 transitions. [2019-09-03 19:52:57,578 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 255 transitions. Word has length 143 [2019-09-03 19:52:57,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:57,578 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 255 transitions. [2019-09-03 19:52:57,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:52:57,578 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 255 transitions. [2019-09-03 19:52:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:57,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:57,579 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:57,580 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:57,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:57,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1702235704, now seen corresponding path program 1 times [2019-09-03 19:52:57,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:57,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:57,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:57,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:57,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:58,190 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-03 19:52:58,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:52:58,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2019-09-03 19:52:58,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:52:58,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:52:58,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:52:58,193 INFO L87 Difference]: Start difference. First operand 217 states and 255 transitions. Second operand 35 states. [2019-09-03 19:52:59,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:59,220 INFO L93 Difference]: Finished difference Result 288 states and 326 transitions. [2019-09-03 19:52:59,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:52:59,226 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 143 [2019-09-03 19:52:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:59,227 INFO L225 Difference]: With dead ends: 288 [2019-09-03 19:52:59,227 INFO L226 Difference]: Without dead ends: 213 [2019-09-03 19:52:59,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:52:59,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-03 19:52:59,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-09-03 19:52:59,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-03 19:52:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2019-09-03 19:52:59,234 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 143 [2019-09-03 19:52:59,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:59,234 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2019-09-03 19:52:59,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:52:59,234 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2019-09-03 19:52:59,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:52:59,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:59,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:59,236 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:59,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:59,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2011984104, now seen corresponding path program 1 times [2019-09-03 19:52:59,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:59,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:59,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:59,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:59,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:00,058 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-03 19:53:00,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:53:00,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2019-09-03 19:53:00,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:53:00,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:53:00,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:53:00,060 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand 39 states. [2019-09-03 19:53:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:02,023 INFO L93 Difference]: Finished difference Result 276 states and 312 transitions. [2019-09-03 19:53:02,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:53:02,024 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 143 [2019-09-03 19:53:02,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:02,026 INFO L225 Difference]: With dead ends: 276 [2019-09-03 19:53:02,026 INFO L226 Difference]: Without dead ends: 205 [2019-09-03 19:53:02,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:53:02,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-03 19:53:02,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-09-03 19:53:02,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-03 19:53:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 237 transitions. [2019-09-03 19:53:02,033 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 237 transitions. Word has length 143 [2019-09-03 19:53:02,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:02,034 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 237 transitions. [2019-09-03 19:53:02,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:53:02,034 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 237 transitions. [2019-09-03 19:53:02,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:53:02,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:02,035 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:02,036 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:02,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:02,036 INFO L82 PathProgramCache]: Analyzing trace with hash 221232183, now seen corresponding path program 1 times [2019-09-03 19:53:02,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:02,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:02,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:02,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:02,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:02,844 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-03 19:53:02,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:53:02,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2019-09-03 19:53:02,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:53:02,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:53:02,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:53:02,847 INFO L87 Difference]: Start difference. First operand 205 states and 237 transitions. Second operand 40 states. [2019-09-03 19:53:04,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:04,153 INFO L93 Difference]: Finished difference Result 266 states and 298 transitions. [2019-09-03 19:53:04,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:53:04,154 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 143 [2019-09-03 19:53:04,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:04,156 INFO L225 Difference]: With dead ends: 266 [2019-09-03 19:53:04,156 INFO L226 Difference]: Without dead ends: 203 [2019-09-03 19:53:04,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:53:04,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-03 19:53:04,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-09-03 19:53:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-03 19:53:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 234 transitions. [2019-09-03 19:53:04,162 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 234 transitions. Word has length 143 [2019-09-03 19:53:04,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:04,162 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 234 transitions. [2019-09-03 19:53:04,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:53:04,162 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 234 transitions. [2019-09-03 19:53:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:53:04,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:04,163 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:04,164 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:04,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:04,164 INFO L82 PathProgramCache]: Analyzing trace with hash 500367692, now seen corresponding path program 1 times [2019-09-03 19:53:04,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:04,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:04,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:04,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:04,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:04,882 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-03 19:53:04,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:53:04,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2019-09-03 19:53:04,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:53:04,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:53:04,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:53:04,884 INFO L87 Difference]: Start difference. First operand 203 states and 234 transitions. Second operand 41 states. [2019-09-03 19:53:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:07,697 INFO L93 Difference]: Finished difference Result 262 states and 293 transitions. [2019-09-03 19:53:07,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:53:07,698 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 143 [2019-09-03 19:53:07,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:07,699 INFO L225 Difference]: With dead ends: 262 [2019-09-03 19:53:07,700 INFO L226 Difference]: Without dead ends: 201 [2019-09-03 19:53:07,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:53:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-03 19:53:07,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-09-03 19:53:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-03 19:53:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 231 transitions. [2019-09-03 19:53:07,707 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 231 transitions. Word has length 143 [2019-09-03 19:53:07,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:07,707 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 231 transitions. [2019-09-03 19:53:07,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:53:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2019-09-03 19:53:07,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:53:07,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:07,708 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:07,709 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:07,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:07,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1383526833, now seen corresponding path program 1 times [2019-09-03 19:53:07,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:07,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:07,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:07,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:07,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:08,432 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-03 19:53:08,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:53:08,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2019-09-03 19:53:08,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:53:08,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:53:08,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:53:08,435 INFO L87 Difference]: Start difference. First operand 201 states and 231 transitions. Second operand 44 states. [2019-09-03 19:53:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:09,833 INFO L93 Difference]: Finished difference Result 254 states and 284 transitions. [2019-09-03 19:53:09,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:53:09,836 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 143 [2019-09-03 19:53:09,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:09,838 INFO L225 Difference]: With dead ends: 254 [2019-09-03 19:53:09,838 INFO L226 Difference]: Without dead ends: 195 [2019-09-03 19:53:09,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:53:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-03 19:53:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-09-03 19:53:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-03 19:53:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 222 transitions. [2019-09-03 19:53:09,844 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 222 transitions. Word has length 143 [2019-09-03 19:53:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:09,844 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 222 transitions. [2019-09-03 19:53:09,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:53:09,844 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2019-09-03 19:53:09,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:53:09,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:09,845 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:09,846 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:09,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:09,846 INFO L82 PathProgramCache]: Analyzing trace with hash -595537121, now seen corresponding path program 1 times [2019-09-03 19:53:09,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:09,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:09,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:09,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:09,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:10,848 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-03 19:53:10,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:53:10,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2019-09-03 19:53:10,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:53:10,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:53:10,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:53:10,850 INFO L87 Difference]: Start difference. First operand 195 states and 222 transitions. Second operand 46 states. [2019-09-03 19:53:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:12,694 INFO L93 Difference]: Finished difference Result 244 states and 271 transitions. [2019-09-03 19:53:12,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 19:53:12,695 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 143 [2019-09-03 19:53:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:12,698 INFO L225 Difference]: With dead ends: 244 [2019-09-03 19:53:12,698 INFO L226 Difference]: Without dead ends: 191 [2019-09-03 19:53:12,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:53:12,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-03 19:53:12,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-09-03 19:53:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-03 19:53:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2019-09-03 19:53:12,705 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 143 [2019-09-03 19:53:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:12,706 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2019-09-03 19:53:12,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:53:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2019-09-03 19:53:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:53:12,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:12,707 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:12,708 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:12,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:12,709 INFO L82 PathProgramCache]: Analyzing trace with hash -830587144, now seen corresponding path program 1 times [2019-09-03 19:53:12,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:12,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:12,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:12,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:12,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:13,667 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-03 19:53:13,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:53:13,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2019-09-03 19:53:13,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:53:13,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:53:13,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:53:13,670 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand 47 states. [2019-09-03 19:53:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:15,170 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions. [2019-09-03 19:53:15,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:53:15,171 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 143 [2019-09-03 19:53:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:15,172 INFO L225 Difference]: With dead ends: 238 [2019-09-03 19:53:15,173 INFO L226 Difference]: Without dead ends: 189 [2019-09-03 19:53:15,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:53:15,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-03 19:53:15,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-09-03 19:53:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-03 19:53:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2019-09-03 19:53:15,179 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 143 [2019-09-03 19:53:15,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:15,180 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2019-09-03 19:53:15,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:53:15,180 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2019-09-03 19:53:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:53:15,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:15,181 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:15,181 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:15,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:15,182 INFO L82 PathProgramCache]: Analyzing trace with hash -228626292, now seen corresponding path program 1 times [2019-09-03 19:53:15,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:15,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:15,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:15,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:15,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:16,023 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-03 19:53:16,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:53:16,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2019-09-03 19:53:16,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:53:16,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:53:16,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:53:16,025 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand 49 states. [2019-09-03 19:53:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:17,398 INFO L93 Difference]: Finished difference Result 232 states and 256 transitions. [2019-09-03 19:53:17,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:53:17,405 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 143 [2019-09-03 19:53:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:17,406 INFO L225 Difference]: With dead ends: 232 [2019-09-03 19:53:17,406 INFO L226 Difference]: Without dead ends: 185 [2019-09-03 19:53:17,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:53:17,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-03 19:53:17,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-09-03 19:53:17,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-03 19:53:17,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2019-09-03 19:53:17,413 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 143 [2019-09-03 19:53:17,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:17,413 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2019-09-03 19:53:17,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:53:17,413 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2019-09-03 19:53:17,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:53:17,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:17,414 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:17,414 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:17,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:17,415 INFO L82 PathProgramCache]: Analyzing trace with hash 679538168, now seen corresponding path program 1 times [2019-09-03 19:53:17,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:17,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:17,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:17,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:17,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:18,322 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-03 19:53:18,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:53:18,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2019-09-03 19:53:18,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:53:18,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:53:18,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:53:18,324 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand 51 states. [2019-09-03 19:53:21,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:21,269 INFO L93 Difference]: Finished difference Result 224 states and 246 transitions. [2019-09-03 19:53:21,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:53:21,269 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 143 [2019-09-03 19:53:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:21,271 INFO L225 Difference]: With dead ends: 224 [2019-09-03 19:53:21,271 INFO L226 Difference]: Without dead ends: 181 [2019-09-03 19:53:21,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:53:21,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-03 19:53:21,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-09-03 19:53:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-03 19:53:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 201 transitions. [2019-09-03 19:53:21,277 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 201 transitions. Word has length 143 [2019-09-03 19:53:21,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:21,278 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 201 transitions. [2019-09-03 19:53:21,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:53:21,278 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 201 transitions. [2019-09-03 19:53:21,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:53:21,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:21,279 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:21,279 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:21,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:21,280 INFO L82 PathProgramCache]: Analyzing trace with hash -200266664, now seen corresponding path program 1 times [2019-09-03 19:53:21,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:21,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:21,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:21,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:21,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:22,408 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-03 19:53:22,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:53:22,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2019-09-03 19:53:22,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 19:53:22,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 19:53:22,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:53:22,412 INFO L87 Difference]: Start difference. First operand 181 states and 201 transitions. Second operand 53 states. [2019-09-03 19:53:23,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:23,597 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2019-09-03 19:53:23,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:53:23,598 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 143 [2019-09-03 19:53:23,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:23,599 INFO L225 Difference]: With dead ends: 216 [2019-09-03 19:53:23,599 INFO L226 Difference]: Without dead ends: 147 [2019-09-03 19:53:23,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:53:23,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-03 19:53:23,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-09-03 19:53:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-03 19:53:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-09-03 19:53:23,606 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 143 [2019-09-03 19:53:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:23,606 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-09-03 19:53:23,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 19:53:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-09-03 19:53:23,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:53:23,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:23,608 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:23,608 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:23,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:23,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1774383300, now seen corresponding path program 1 times [2019-09-03 19:53:23,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:23,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:23,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:23,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:23,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:25,428 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-03 19:53:25,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:53:25,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2019-09-03 19:53:25,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 19:53:25,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 19:53:25,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:53:25,432 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 70 states. [2019-09-03 19:53:28,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:28,089 INFO L93 Difference]: Finished difference Result 186 states and 188 transitions. [2019-09-03 19:53:28,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-03 19:53:28,090 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 143 [2019-09-03 19:53:28,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:28,091 INFO L225 Difference]: With dead ends: 186 [2019-09-03 19:53:28,091 INFO L226 Difference]: Without dead ends: 147 [2019-09-03 19:53:28,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:53:28,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-03 19:53:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-09-03 19:53:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-03 19:53:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-09-03 19:53:28,097 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2019-09-03 19:53:28,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:28,098 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-09-03 19:53:28,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 19:53:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-09-03 19:53:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-03 19:53:28,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:28,099 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:28,099 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:28,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:28,099 INFO L82 PathProgramCache]: Analyzing trace with hash -87860138, now seen corresponding path program 1 times [2019-09-03 19:53:28,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:28,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:28,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:28,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:28,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:29,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:29,813 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:29,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:29,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 19:53:29,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:30,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:30,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2019-09-03 19:53:30,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 19:53:30,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 19:53:30,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 19:53:30,082 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 71 states. [2019-09-03 19:53:32,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:32,618 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2019-09-03 19:53:32,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 19:53:32,620 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 145 [2019-09-03 19:53:32,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:32,622 INFO L225 Difference]: With dead ends: 152 [2019-09-03 19:53:32,622 INFO L226 Difference]: Without dead ends: 149 [2019-09-03 19:53:32,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 19:53:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-03 19:53:32,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-09-03 19:53:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-03 19:53:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-09-03 19:53:32,637 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2019-09-03 19:53:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:32,637 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-09-03 19:53:32,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 19:53:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-09-03 19:53:32,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-03 19:53:32,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:32,644 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:32,645 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:32,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:32,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1458227952, now seen corresponding path program 2 times [2019-09-03 19:53:32,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:32,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:32,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:32,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:32,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:34,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:34,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:34,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:34,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:34,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:34,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 19:53:34,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:34,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:34,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2019-09-03 19:53:34,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 19:53:34,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 19:53:34,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 19:53:34,784 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 72 states. [2019-09-03 19:53:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:36,912 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2019-09-03 19:53:36,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 19:53:36,916 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 147 [2019-09-03 19:53:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:36,918 INFO L225 Difference]: With dead ends: 154 [2019-09-03 19:53:36,918 INFO L226 Difference]: Without dead ends: 151 [2019-09-03 19:53:36,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 19:53:36,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-03 19:53:36,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-09-03 19:53:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-03 19:53:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2019-09-03 19:53:36,924 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2019-09-03 19:53:36,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:36,924 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2019-09-03 19:53:36,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 19:53:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2019-09-03 19:53:36,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-03 19:53:36,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:36,926 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:53:36,926 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:36,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:36,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1190198026, now seen corresponding path program 3 times [2019-09-03 19:53:36,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:36,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:36,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:36,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:36,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:38,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:38,759 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-03 19:53:38,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:38,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:53:38,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:38,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 19:53:38,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:53:38,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:38,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-09-03 19:53:38,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 19:53:38,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 19:53:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 19:53:38,892 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 73 states. [2019-09-03 19:53:41,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:41,541 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-09-03 19:53:41,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 19:53:41,541 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 149 [2019-09-03 19:53:41,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:41,543 INFO L225 Difference]: With dead ends: 156 [2019-09-03 19:53:41,543 INFO L226 Difference]: Without dead ends: 153 [2019-09-03 19:53:41,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 19:53:41,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-03 19:53:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-09-03 19:53:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-03 19:53:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-09-03 19:53:41,548 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2019-09-03 19:53:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:41,549 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-09-03 19:53:41,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 19:53:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-09-03 19:53:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-03 19:53:41,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:41,550 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:53:41,550 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:41,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:41,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1311476900, now seen corresponding path program 4 times [2019-09-03 19:53:41,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:41,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:41,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:41,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:41,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:43,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:43,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:43,465 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:43,521 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:43,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:43,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-03 19:53:43,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:43,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:43,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2019-09-03 19:53:43,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 19:53:43,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 19:53:43,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:53:43,579 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 74 states. [2019-09-03 19:53:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:46,297 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2019-09-03 19:53:46,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 19:53:46,297 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 151 [2019-09-03 19:53:46,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:46,299 INFO L225 Difference]: With dead ends: 158 [2019-09-03 19:53:46,299 INFO L226 Difference]: Without dead ends: 155 [2019-09-03 19:53:46,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:53:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-03 19:53:46,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-09-03 19:53:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-03 19:53:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-09-03 19:53:46,306 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2019-09-03 19:53:46,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:46,307 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-09-03 19:53:46,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 19:53:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-09-03 19:53:46,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-03 19:53:46,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:46,308 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:53:46,308 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:46,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:46,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1896357822, now seen corresponding path program 5 times [2019-09-03 19:53:46,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:46,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:46,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:46,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:46,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:48,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:48,194 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-03 19:53:48,205 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:48,268 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:53:48,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:48,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 19:53:48,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:53:48,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:48,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2019-09-03 19:53:48,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 19:53:48,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 19:53:48,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 19:53:48,342 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 75 states. [2019-09-03 19:53:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:49,851 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-09-03 19:53:49,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 19:53:49,851 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 153 [2019-09-03 19:53:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:49,853 INFO L225 Difference]: With dead ends: 160 [2019-09-03 19:53:49,853 INFO L226 Difference]: Without dead ends: 157 [2019-09-03 19:53:49,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 19:53:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-03 19:53:49,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-09-03 19:53:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-03 19:53:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-09-03 19:53:49,860 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2019-09-03 19:53:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:49,860 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-09-03 19:53:49,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 19:53:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-09-03 19:53:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-03 19:53:49,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:49,861 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:53:49,862 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:49,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:49,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1326208088, now seen corresponding path program 6 times [2019-09-03 19:53:49,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:49,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:49,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:49,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:49,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:51,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:51,945 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:51,956 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:52,013 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:53:52,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:52,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-03 19:53:52,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:52,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:52,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2019-09-03 19:53:52,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 19:53:52,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 19:53:52,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:53:52,061 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 76 states. [2019-09-03 19:53:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:53,927 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-09-03 19:53:53,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 19:53:53,927 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 155 [2019-09-03 19:53:53,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:53,929 INFO L225 Difference]: With dead ends: 162 [2019-09-03 19:53:53,929 INFO L226 Difference]: Without dead ends: 159 [2019-09-03 19:53:53,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:53:53,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-03 19:53:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-09-03 19:53:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-03 19:53:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-09-03 19:53:53,935 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2019-09-03 19:53:53,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:53,935 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-09-03 19:53:53,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 19:53:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-09-03 19:53:53,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-03 19:53:53,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:53,937 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:53:53,937 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:53,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:53,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1126839694, now seen corresponding path program 7 times [2019-09-03 19:53:53,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:53,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:53,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:53,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:53,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:56,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:56,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:53:56,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:56,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 19:53:56,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:56,209 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:56,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:56,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2019-09-03 19:53:56,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 19:53:56,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 19:53:56,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 19:53:56,216 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 77 states. [2019-09-03 19:53:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:58,685 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2019-09-03 19:53:58,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 19:53:58,686 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 157 [2019-09-03 19:53:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:58,687 INFO L225 Difference]: With dead ends: 164 [2019-09-03 19:53:58,687 INFO L226 Difference]: Without dead ends: 161 [2019-09-03 19:53:58,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 19:53:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-03 19:53:58,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-09-03 19:53:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:53:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-09-03 19:53:58,691 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2019-09-03 19:53:58,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:58,691 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-09-03 19:53:58,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 19:53:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-09-03 19:53:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-03 19:53:58,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:58,692 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:53:58,693 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:58,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:58,693 INFO L82 PathProgramCache]: Analyzing trace with hash -568712692, now seen corresponding path program 8 times [2019-09-03 19:53:58,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:58,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:58,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:58,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:58,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:00,774 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:00,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:00,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:00,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:00,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:00,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:00,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 19:54:00,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:00,881 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 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-03 19:54:00,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:00,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2019-09-03 19:54:00,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 19:54:00,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 19:54:00,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 19:54:00,889 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 78 states. [2019-09-03 19:54:03,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:03,143 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2019-09-03 19:54:03,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-03 19:54:03,144 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 159 [2019-09-03 19:54:03,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:03,145 INFO L225 Difference]: With dead ends: 166 [2019-09-03 19:54:03,145 INFO L226 Difference]: Without dead ends: 163 [2019-09-03 19:54:03,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 19:54:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-03 19:54:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-09-03 19:54:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-03 19:54:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-09-03 19:54:03,150 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2019-09-03 19:54:03,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:03,151 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-09-03 19:54:03,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 19:54:03,151 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-09-03 19:54:03,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-03 19:54:03,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:03,153 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:54:03,153 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:03,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:03,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1079575770, now seen corresponding path program 9 times [2019-09-03 19:54:03,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:03,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:03,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:03,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:03,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:05,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:05,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:05,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:05,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 19:54:05,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:05,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 19:54:05,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:05,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:05,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2019-09-03 19:54:05,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 19:54:05,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 19:54:05,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 19:54:05,679 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 79 states. [2019-09-03 19:54:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:07,331 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2019-09-03 19:54:07,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 19:54:07,332 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 161 [2019-09-03 19:54:07,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:07,333 INFO L225 Difference]: With dead ends: 168 [2019-09-03 19:54:07,333 INFO L226 Difference]: Without dead ends: 165 [2019-09-03 19:54:07,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 19:54:07,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-03 19:54:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-09-03 19:54:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-03 19:54:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-09-03 19:54:07,338 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2019-09-03 19:54:07,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:07,339 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-09-03 19:54:07,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 19:54:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-09-03 19:54:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-03 19:54:07,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:07,340 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:54:07,340 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:07,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:07,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1902245312, now seen corresponding path program 10 times [2019-09-03 19:54:07,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:07,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:07,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:07,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:07,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:09,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:09,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:09,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:09,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:09,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:09,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-03 19:54:09,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:09,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:09,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2019-09-03 19:54:09,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-03 19:54:09,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-03 19:54:09,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 19:54:09,619 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 80 states. [2019-09-03 19:54:11,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:11,460 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-09-03 19:54:11,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-03 19:54:11,461 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 163 [2019-09-03 19:54:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:11,462 INFO L225 Difference]: With dead ends: 170 [2019-09-03 19:54:11,462 INFO L226 Difference]: Without dead ends: 167 [2019-09-03 19:54:11,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 19:54:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-03 19:54:11,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-09-03 19:54:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-03 19:54:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-09-03 19:54:11,467 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2019-09-03 19:54:11,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:11,468 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-09-03 19:54:11,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-03 19:54:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-09-03 19:54:11,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-03 19:54:11,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:11,469 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:54:11,469 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:11,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:11,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1605848614, now seen corresponding path program 11 times [2019-09-03 19:54:11,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:11,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:11,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:11,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:11,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:13,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:13,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:13,749 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:13,824 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-03 19:54:13,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:13,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 19:54:13,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:13,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:13,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2019-09-03 19:54:13,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 19:54:13,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 19:54:13,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 19:54:13,876 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 81 states. [2019-09-03 19:54:16,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:16,621 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2019-09-03 19:54:16,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 19:54:16,621 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 165 [2019-09-03 19:54:16,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:16,623 INFO L225 Difference]: With dead ends: 172 [2019-09-03 19:54:16,623 INFO L226 Difference]: Without dead ends: 169 [2019-09-03 19:54:16,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 19:54:16,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-03 19:54:16,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-09-03 19:54:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-03 19:54:16,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2019-09-03 19:54:16,631 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2019-09-03 19:54:16,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:16,632 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2019-09-03 19:54:16,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 19:54:16,632 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2019-09-03 19:54:16,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-03 19:54:16,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:16,633 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:54:16,633 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:16,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:16,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1334784140, now seen corresponding path program 12 times [2019-09-03 19:54:16,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:16,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:16,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:16,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:16,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:18,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:18,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:18,925 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:18,989 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:54:18,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:18,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 19:54:18,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:19,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:19,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2019-09-03 19:54:19,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 19:54:19,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 19:54:19,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:54:19,037 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 82 states. [2019-09-03 19:54:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:20,685 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-09-03 19:54:20,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-03 19:54:20,685 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 167 [2019-09-03 19:54:20,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:20,687 INFO L225 Difference]: With dead ends: 174 [2019-09-03 19:54:20,687 INFO L226 Difference]: Without dead ends: 171 [2019-09-03 19:54:20,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:54:20,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-03 19:54:20,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-09-03 19:54:20,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:54:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-09-03 19:54:20,693 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2019-09-03 19:54:20,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:20,693 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2019-09-03 19:54:20,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 19:54:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2019-09-03 19:54:20,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-03 19:54:20,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:20,694 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:54:20,694 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:20,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:20,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1460137614, now seen corresponding path program 13 times [2019-09-03 19:54:20,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:20,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:20,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:20,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:20,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:23,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:23,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:23,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:23,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 19:54:23,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:23,113 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:23,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:23,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2019-09-03 19:54:23,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 19:54:23,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 19:54:23,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 19:54:23,117 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 83 states. [2019-09-03 19:54:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:25,902 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2019-09-03 19:54:25,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 19:54:25,903 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 169 [2019-09-03 19:54:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:25,904 INFO L225 Difference]: With dead ends: 176 [2019-09-03 19:54:25,904 INFO L226 Difference]: Without dead ends: 173 [2019-09-03 19:54:25,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 19:54:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-03 19:54:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-03 19:54:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-03 19:54:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-09-03 19:54:25,910 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2019-09-03 19:54:25,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:25,911 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-09-03 19:54:25,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 19:54:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-09-03 19:54:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-03 19:54:25,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:25,912 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:54:25,912 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:25,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1269584088, now seen corresponding path program 14 times [2019-09-03 19:54:25,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:25,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:25,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:25,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:25,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:28,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:28,369 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-03 19:54:28,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:28,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:28,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:28,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 19:54:28,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:28,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:28,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2019-09-03 19:54:28,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 19:54:28,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 19:54:28,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 19:54:28,491 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 84 states. [2019-09-03 19:54:30,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:30,154 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2019-09-03 19:54:30,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 19:54:30,155 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 171 [2019-09-03 19:54:30,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:30,156 INFO L225 Difference]: With dead ends: 178 [2019-09-03 19:54:30,157 INFO L226 Difference]: Without dead ends: 175 [2019-09-03 19:54:30,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 19:54:30,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-03 19:54:30,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-09-03 19:54:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-03 19:54:30,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2019-09-03 19:54:30,166 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2019-09-03 19:54:30,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:30,166 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2019-09-03 19:54:30,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 19:54:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2019-09-03 19:54:30,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-03 19:54:30,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:30,167 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:54:30,168 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:30,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:30,168 INFO L82 PathProgramCache]: Analyzing trace with hash -307121854, now seen corresponding path program 15 times [2019-09-03 19:54:30,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:30,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:30,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:30,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:30,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:32,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:32,731 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-03 19:54:32,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:32,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 19:54:32,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:32,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 19:54:32,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:32,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:32,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2019-09-03 19:54:32,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 19:54:32,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 19:54:32,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 19:54:32,867 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 85 states. [2019-09-03 19:54:35,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:35,087 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-09-03 19:54:35,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 19:54:35,088 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 173 [2019-09-03 19:54:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:35,089 INFO L225 Difference]: With dead ends: 180 [2019-09-03 19:54:35,089 INFO L226 Difference]: Without dead ends: 177 [2019-09-03 19:54:35,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 19:54:35,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-03 19:54:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-09-03 19:54:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-03 19:54:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-09-03 19:54:35,096 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2019-09-03 19:54:35,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:35,096 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-09-03 19:54:35,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 19:54:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-09-03 19:54:35,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-03 19:54:35,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:35,097 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:54:35,098 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:35,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:35,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1201116380, now seen corresponding path program 16 times [2019-09-03 19:54:35,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:35,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:35,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:35,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:35,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:37,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:37,578 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-03 19:54:37,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:37,644 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:37,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:37,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-03 19:54:37,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:37,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:37,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2019-09-03 19:54:37,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-03 19:54:37,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-03 19:54:37,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 19:54:37,694 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 86 states. [2019-09-03 19:54:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:40,449 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2019-09-03 19:54:40,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-03 19:54:40,450 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 175 [2019-09-03 19:54:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:40,451 INFO L225 Difference]: With dead ends: 182 [2019-09-03 19:54:40,451 INFO L226 Difference]: Without dead ends: 179 [2019-09-03 19:54:40,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 19:54:40,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-03 19:54:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-09-03 19:54:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-03 19:54:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-09-03 19:54:40,458 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2019-09-03 19:54:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:40,459 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-09-03 19:54:40,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-03 19:54:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-09-03 19:54:40,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-03 19:54:40,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:40,460 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:54:40,460 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:40,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:40,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1080886794, now seen corresponding path program 17 times [2019-09-03 19:54:40,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:40,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:40,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:40,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:40,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:43,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:43,029 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) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:43,043 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:43,103 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-03 19:54:43,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:43,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 19:54:43,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:43,156 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:43,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:43,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2019-09-03 19:54:43,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-03 19:54:43,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-03 19:54:43,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 19:54:43,162 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 87 states. [2019-09-03 19:54:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:45,897 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2019-09-03 19:54:45,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 19:54:45,898 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 177 [2019-09-03 19:54:45,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:45,900 INFO L225 Difference]: With dead ends: 184 [2019-09-03 19:54:45,900 INFO L226 Difference]: Without dead ends: 181 [2019-09-03 19:54:45,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 19:54:45,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-03 19:54:45,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-09-03 19:54:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:54:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2019-09-03 19:54:45,906 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2019-09-03 19:54:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:45,906 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2019-09-03 19:54:45,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-03 19:54:45,906 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2019-09-03 19:54:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-03 19:54:45,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:45,907 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:54:45,908 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:45,908 INFO L82 PathProgramCache]: Analyzing trace with hash 642351248, now seen corresponding path program 18 times [2019-09-03 19:54:45,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:45,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:45,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:45,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:45,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:48,509 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:48,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:48,510 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-03 19:54:48,520 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:48,598 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-03 19:54:48,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:48,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-03 19:54:48,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:48,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:48,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2019-09-03 19:54:48,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 19:54:48,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 19:54:48,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 19:54:48,656 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 88 states. [2019-09-03 19:54:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:51,431 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-09-03 19:54:51,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-03 19:54:51,431 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 179 [2019-09-03 19:54:51,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:51,433 INFO L225 Difference]: With dead ends: 186 [2019-09-03 19:54:51,433 INFO L226 Difference]: Without dead ends: 183 [2019-09-03 19:54:51,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 19:54:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-03 19:54:51,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-09-03 19:54:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-03 19:54:51,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-09-03 19:54:51,439 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2019-09-03 19:54:51,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:51,439 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-09-03 19:54:51,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 19:54:51,440 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-09-03 19:54:51,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-03 19:54:51,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:51,441 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:54:51,441 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:51,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:51,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1183266646, now seen corresponding path program 19 times [2019-09-03 19:54:51,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:51,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:51,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:51,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:51,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:54,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:54,090 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-03 19:54:54,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:54,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 19:54:54,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:54,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:54,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2019-09-03 19:54:54,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 19:54:54,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 19:54:54,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 19:54:54,243 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 89 states. [2019-09-03 19:54:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:56,766 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2019-09-03 19:54:56,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 19:54:56,767 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 181 [2019-09-03 19:54:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:56,768 INFO L225 Difference]: With dead ends: 188 [2019-09-03 19:54:56,769 INFO L226 Difference]: Without dead ends: 185 [2019-09-03 19:54:56,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 19:54:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-03 19:54:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-09-03 19:54:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-03 19:54:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-09-03 19:54:56,775 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2019-09-03 19:54:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:56,775 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-09-03 19:54:56,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 19:54:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-09-03 19:54:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-03 19:54:56,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:56,777 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:54:56,777 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:56,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1039561284, now seen corresponding path program 20 times [2019-09-03 19:54:56,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:56,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:56,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:56,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:56,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:59,572 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:59,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:59,572 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) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:59,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:59,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:59,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:59,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-03 19:54:59,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:54:59,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:59,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2019-09-03 19:54:59,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-03 19:54:59,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-03 19:54:59,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 19:54:59,688 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 90 states. [2019-09-03 19:55:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:01,280 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-09-03 19:55:01,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 19:55:01,280 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 183 [2019-09-03 19:55:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:01,282 INFO L225 Difference]: With dead ends: 190 [2019-09-03 19:55:01,282 INFO L226 Difference]: Without dead ends: 187 [2019-09-03 19:55:01,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 19:55:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-03 19:55:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-09-03 19:55:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-03 19:55:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-09-03 19:55:01,288 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2019-09-03 19:55:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:01,289 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-09-03 19:55:01,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-03 19:55:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-09-03 19:55:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-03 19:55:01,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:01,290 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:55:01,290 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:01,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:01,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1716511394, now seen corresponding path program 21 times [2019-09-03 19:55:01,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:01,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:01,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:01,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:01,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:04,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:04,057 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-03 19:55:04,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:04,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-03 19:55:04,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:04,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 19:55:04,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:04,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:04,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2019-09-03 19:55:04,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 19:55:04,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 19:55:04,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 19:55:04,239 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 91 states. [2019-09-03 19:55:07,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:07,033 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2019-09-03 19:55:07,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 19:55:07,034 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 185 [2019-09-03 19:55:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:07,035 INFO L225 Difference]: With dead ends: 192 [2019-09-03 19:55:07,035 INFO L226 Difference]: Without dead ends: 189 [2019-09-03 19:55:07,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 19:55:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-03 19:55:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-09-03 19:55:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-03 19:55:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-09-03 19:55:07,043 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2019-09-03 19:55:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:07,043 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2019-09-03 19:55:07,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 19:55:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2019-09-03 19:55:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-03 19:55:07,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:07,045 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:55:07,045 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:07,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:07,045 INFO L82 PathProgramCache]: Analyzing trace with hash -307533320, now seen corresponding path program 22 times [2019-09-03 19:55:07,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:07,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:07,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:07,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:07,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:09,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:09,868 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-03 19:55:09,878 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:09,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:09,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:09,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-03 19:55:09,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:09,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:09,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2019-09-03 19:55:09,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-03 19:55:09,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-03 19:55:09,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 19:55:09,999 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 92 states. [2019-09-03 19:55:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:12,386 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2019-09-03 19:55:12,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-03 19:55:12,392 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 187 [2019-09-03 19:55:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:12,394 INFO L225 Difference]: With dead ends: 194 [2019-09-03 19:55:12,394 INFO L226 Difference]: Without dead ends: 191 [2019-09-03 19:55:12,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 19:55:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-03 19:55:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-09-03 19:55:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 19:55:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-09-03 19:55:12,399 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2019-09-03 19:55:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:12,399 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-09-03 19:55:12,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-03 19:55:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-09-03 19:55:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-03 19:55:12,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:12,401 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:55:12,401 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:12,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:12,402 INFO L82 PathProgramCache]: Analyzing trace with hash 805697554, now seen corresponding path program 23 times [2019-09-03 19:55:12,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:12,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:12,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:12,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:12,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:15,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:15,299 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-03 19:55:15,309 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:15,375 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-03 19:55:15,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:15,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 19:55:15,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:15,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:15,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-09-03 19:55:15,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 19:55:15,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 19:55:15,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 19:55:15,433 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 93 states. [2019-09-03 19:55:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:18,167 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2019-09-03 19:55:18,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 19:55:18,168 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 189 [2019-09-03 19:55:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:18,172 INFO L225 Difference]: With dead ends: 196 [2019-09-03 19:55:18,172 INFO L226 Difference]: Without dead ends: 193 [2019-09-03 19:55:18,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 19:55:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-03 19:55:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-09-03 19:55:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-03 19:55:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-09-03 19:55:18,182 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2019-09-03 19:55:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:18,182 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-09-03 19:55:18,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 19:55:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-09-03 19:55:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-03 19:55:18,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:18,184 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:55:18,184 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:18,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1173710764, now seen corresponding path program 24 times [2019-09-03 19:55:18,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:18,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:18,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:18,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:18,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:21,144 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:21,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:21,145 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) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:21,156 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:21,244 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-03 19:55:21,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:21,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 19:55:21,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:21,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:21,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-09-03 19:55:21,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-03 19:55:21,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-03 19:55:21,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 19:55:21,310 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 94 states. [2019-09-03 19:55:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:22,877 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-09-03 19:55:22,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-03 19:55:22,877 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 191 [2019-09-03 19:55:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:22,879 INFO L225 Difference]: With dead ends: 198 [2019-09-03 19:55:22,879 INFO L226 Difference]: Without dead ends: 195 [2019-09-03 19:55:22,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 19:55:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-03 19:55:22,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-09-03 19:55:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-03 19:55:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-09-03 19:55:22,884 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2019-09-03 19:55:22,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:22,884 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2019-09-03 19:55:22,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-03 19:55:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2019-09-03 19:55:22,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-03 19:55:22,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:22,885 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:55:22,885 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:22,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:22,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1647879994, now seen corresponding path program 25 times [2019-09-03 19:55:22,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:22,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:22,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:22,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:22,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:25,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:25,918 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-03 19:55:25,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:25,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 19:55:25,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 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-03 19:55:26,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:26,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-09-03 19:55:26,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 19:55:26,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 19:55:26,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 19:55:26,050 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 95 states. [2019-09-03 19:55:28,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:28,850 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-09-03 19:55:28,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 19:55:28,850 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 193 [2019-09-03 19:55:28,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:28,852 INFO L225 Difference]: With dead ends: 200 [2019-09-03 19:55:28,852 INFO L226 Difference]: Without dead ends: 197 [2019-09-03 19:55:28,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 19:55:28,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-03 19:55:28,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-09-03 19:55:28,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-03 19:55:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-09-03 19:55:28,857 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2019-09-03 19:55:28,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:28,857 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-09-03 19:55:28,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 19:55:28,857 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-09-03 19:55:28,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-03 19:55:28,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:28,858 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:55:28,858 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:28,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:28,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1222732640, now seen corresponding path program 26 times [2019-09-03 19:55:28,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:28,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:28,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:28,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:28,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:31,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:31,928 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) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:31,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:55:32,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:32,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:32,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-03 19:55:32,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:32,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:32,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-09-03 19:55:32,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-03 19:55:32,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-03 19:55:32,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 19:55:32,095 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 96 states. [2019-09-03 19:55:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:34,823 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2019-09-03 19:55:34,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-03 19:55:34,824 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 195 [2019-09-03 19:55:34,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:34,826 INFO L225 Difference]: With dead ends: 202 [2019-09-03 19:55:34,826 INFO L226 Difference]: Without dead ends: 199 [2019-09-03 19:55:34,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 19:55:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-03 19:55:34,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-09-03 19:55:34,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-03 19:55:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2019-09-03 19:55:34,832 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2019-09-03 19:55:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:34,832 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2019-09-03 19:55:34,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-03 19:55:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2019-09-03 19:55:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-03 19:55:34,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:34,833 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:55:34,834 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:34,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:34,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1782497414, now seen corresponding path program 27 times [2019-09-03 19:55:34,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:34,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:34,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:34,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:34,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:37,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:37,954 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-03 19:55:37,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:38,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-03 19:55:38,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:38,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 19:55:38,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:55:38,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:38,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2019-09-03 19:55:38,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 19:55:38,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 19:55:38,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 19:55:38,140 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 97 states. [2019-09-03 19:55:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:40,912 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2019-09-03 19:55:40,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 19:55:40,913 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 197 [2019-09-03 19:55:40,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:40,914 INFO L225 Difference]: With dead ends: 204 [2019-09-03 19:55:40,914 INFO L226 Difference]: Without dead ends: 201 [2019-09-03 19:55:40,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 19:55:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-03 19:55:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-09-03 19:55:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 19:55:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2019-09-03 19:55:40,921 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2019-09-03 19:55:40,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:40,921 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2019-09-03 19:55:40,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 19:55:40,922 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2019-09-03 19:55:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-03 19:55:40,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:40,923 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:55:40,923 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:40,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:40,923 INFO L82 PathProgramCache]: Analyzing trace with hash 704410900, now seen corresponding path program 28 times [2019-09-03 19:55:40,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:40,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:40,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:40,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:40,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:44,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:44,100 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) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:44,110 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:44,173 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:44,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:44,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-03 19:55:44,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:44,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:44,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2019-09-03 19:55:44,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-03 19:55:44,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-03 19:55:44,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 19:55:44,236 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 98 states. [2019-09-03 19:55:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:47,042 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-09-03 19:55:47,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 19:55:47,043 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 199 [2019-09-03 19:55:47,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:47,044 INFO L225 Difference]: With dead ends: 206 [2019-09-03 19:55:47,044 INFO L226 Difference]: Without dead ends: 203 [2019-09-03 19:55:47,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 19:55:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-03 19:55:47,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-09-03 19:55:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-03 19:55:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-09-03 19:55:47,050 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 199 [2019-09-03 19:55:47,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:47,050 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-09-03 19:55:47,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-03 19:55:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-09-03 19:55:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-03 19:55:47,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:47,051 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:55:47,051 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:47,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:47,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1673483218, now seen corresponding path program 29 times [2019-09-03 19:55:47,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:47,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:47,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:47,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:47,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:50,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:50,297 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-03 19:55:50,307 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:50,378 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-03 19:55:50,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:50,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 19:55:50,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:50,424 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:50,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:50,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-09-03 19:55:50,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 19:55:50,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 19:55:50,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 19:55:50,428 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 99 states. [2019-09-03 19:55:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:53,184 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2019-09-03 19:55:53,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 19:55:53,185 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 201 [2019-09-03 19:55:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:53,186 INFO L225 Difference]: With dead ends: 208 [2019-09-03 19:55:53,187 INFO L226 Difference]: Without dead ends: 205 [2019-09-03 19:55:53,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 19:55:53,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-03 19:55:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-09-03 19:55:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-09-03 19:55:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2019-09-03 19:55:53,192 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 201 [2019-09-03 19:55:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:53,192 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2019-09-03 19:55:53,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 19:55:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2019-09-03 19:55:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-03 19:55:53,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:53,193 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:55:53,193 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:53,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:53,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1907129144, now seen corresponding path program 30 times [2019-09-03 19:55:53,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:53,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:53,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:53,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:53,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:56,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:56,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:56,514 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:56,617 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-03 19:55:56,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:56,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-03 19:55:56,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:56,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:56,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-09-03 19:55:56,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-03 19:55:56,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-03 19:55:56,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 19:55:56,676 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 100 states. [2019-09-03 19:55:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:58,257 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-09-03 19:55:58,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-03 19:55:58,258 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 203 [2019-09-03 19:55:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:58,259 INFO L225 Difference]: With dead ends: 210 [2019-09-03 19:55:58,259 INFO L226 Difference]: Without dead ends: 207 [2019-09-03 19:55:58,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 19:55:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-03 19:55:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-09-03 19:55:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-03 19:55:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-09-03 19:55:58,264 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 203 [2019-09-03 19:55:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:58,264 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-09-03 19:55:58,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-03 19:55:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-09-03 19:55:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-03 19:55:58,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:58,265 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:55:58,265 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:58,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:58,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1192402658, now seen corresponding path program 31 times [2019-09-03 19:55:58,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:58,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:58,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:58,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:58,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:01,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:01,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:01,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:01,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 19:56:01,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:01,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:01,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-09-03 19:56:01,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-03 19:56:01,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-03 19:56:01,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 19:56:01,796 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 101 states. [2019-09-03 19:56:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:04,632 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2019-09-03 19:56:04,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 19:56:04,632 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 205 [2019-09-03 19:56:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:04,633 INFO L225 Difference]: With dead ends: 212 [2019-09-03 19:56:04,633 INFO L226 Difference]: Without dead ends: 209 [2019-09-03 19:56:04,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 19:56:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-03 19:56:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-09-03 19:56:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-03 19:56:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-09-03 19:56:04,638 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2019-09-03 19:56:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:04,639 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-09-03 19:56:04,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-03 19:56:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-09-03 19:56:04,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-03 19:56:04,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:04,640 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:56:04,640 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:04,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:04,640 INFO L82 PathProgramCache]: Analyzing trace with hash -864839044, now seen corresponding path program 32 times [2019-09-03 19:56:04,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:04,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:04,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:04,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:04,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:08,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:08,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:08,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:08,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:08,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:08,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-03 19:56:08,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:08,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:08,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-09-03 19:56:08,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-03 19:56:08,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-03 19:56:08,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 19:56:08,258 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 102 states. [2019-09-03 19:56:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:11,019 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-09-03 19:56:11,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-03 19:56:11,020 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 207 [2019-09-03 19:56:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:11,021 INFO L225 Difference]: With dead ends: 213 [2019-09-03 19:56:11,021 INFO L226 Difference]: Without dead ends: 210 [2019-09-03 19:56:11,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 19:56:11,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-03 19:56:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-09-03 19:56:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 19:56:11,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2019-09-03 19:56:11,025 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 207 [2019-09-03 19:56:11,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:11,025 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2019-09-03 19:56:11,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-03 19:56:11,026 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2019-09-03 19:56:11,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-03 19:56:11,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:11,026 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:56:11,027 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:11,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:11,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2105808790, now seen corresponding path program 33 times [2019-09-03 19:56:11,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:11,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:11,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:12,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:12,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:12,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:13,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-03 19:56:13,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:13,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 19:56:13,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:13,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:13,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:13,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-09-03 19:56:13,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 19:56:13,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 19:56:13,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:56:13,276 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 55 states. [2019-09-03 19:56:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:15,029 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-09-03 19:56:15,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 19:56:15,030 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2019-09-03 19:56:15,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:15,031 INFO L225 Difference]: With dead ends: 216 [2019-09-03 19:56:15,031 INFO L226 Difference]: Without dead ends: 213 [2019-09-03 19:56:15,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:56:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-03 19:56:15,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-09-03 19:56:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-03 19:56:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-09-03 19:56:15,040 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 209 [2019-09-03 19:56:15,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:15,040 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-09-03 19:56:15,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 19:56:15,040 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-09-03 19:56:15,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-03 19:56:15,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:15,041 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:56:15,042 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:15,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:15,042 INFO L82 PathProgramCache]: Analyzing trace with hash 745125424, now seen corresponding path program 34 times [2019-09-03 19:56:15,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:15,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:15,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:15,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:15,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:16,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:56:16,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-09-03 19:56:16,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:56:16,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:56:16,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:56:16,152 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 52 states. [2019-09-03 19:56:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:16,578 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2019-09-03 19:56:16,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 19:56:16,579 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2019-09-03 19:56:16,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:16,579 INFO L225 Difference]: With dead ends: 212 [2019-09-03 19:56:16,580 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 19:56:16,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:56:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 19:56:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 19:56:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 19:56:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 19:56:16,581 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-09-03 19:56:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:16,582 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 19:56:16,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:56:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 19:56:16,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 19:56:16,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 19:56:17,786 WARN L188 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 206 [2019-09-03 19:56:18,095 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:56:18,095 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:56:18,095 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:56:18,096 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:56:18,096 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 19:56:18,096 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:56:18,096 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:56:18,096 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 1253) no Hoare annotation was computed. [2019-09-03 19:56:18,096 INFO L439 ceAbstractionStarter]: At program point L1126(lines 74 1127) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 11) (<= 50 main_~main__y~0) (<= 11 main_~main__x~0)) [2019-09-03 19:56:18,097 INFO L439 ceAbstractionStarter]: At program point L994(lines 140 995) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 22) (<= 22 main_~main__x~0)) [2019-09-03 19:56:18,097 INFO L439 ceAbstractionStarter]: At program point L862(lines 206 863) the Hoare annotation is: (and (<= 33 main_~main__x~0) (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 33)) [2019-09-03 19:56:18,097 INFO L439 ceAbstractionStarter]: At program point L730(lines 272 731) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 44 main_~main__x~0) (<= 50 main_~main__y~0) (<= main_~main__x~0 44)) [2019-09-03 19:56:18,097 INFO L439 ceAbstractionStarter]: At program point L598(lines 338 599) the Hoare annotation is: (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0)) [2019-09-03 19:56:18,097 INFO L439 ceAbstractionStarter]: At program point L466(lines 404 467) the Hoare annotation is: (and (<= main_~main__x~0 66) (<= main_~main__y~0 66) (<= 66 main_~main__y~0) (<= 66 main_~main__x~0)) [2019-09-03 19:56:18,097 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 539) no Hoare annotation was computed. [2019-09-03 19:56:18,097 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 671) no Hoare annotation was computed. [2019-09-03 19:56:18,097 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 1253) no Hoare annotation was computed. [2019-09-03 19:56:18,097 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 803) no Hoare annotation was computed. [2019-09-03 19:56:18,098 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 935) no Hoare annotation was computed. [2019-09-03 19:56:18,098 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 1067) no Hoare annotation was computed. [2019-09-03 19:56:18,098 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 1199) no Hoare annotation was computed. [2019-09-03 19:56:18,098 INFO L439 ceAbstractionStarter]: At program point L1162(lines 56 1163) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 8) (<= 8 main_~main__x~0) (<= 50 main_~main__y~0)) [2019-09-03 19:56:18,098 INFO L439 ceAbstractionStarter]: At program point L1030(lines 122 1031) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 19) (<= 50 main_~main__y~0) (<= 19 main_~main__x~0)) [2019-09-03 19:56:18,098 INFO L439 ceAbstractionStarter]: At program point L898(lines 188 899) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 30) (<= 50 main_~main__y~0) (<= 30 main_~main__x~0)) [2019-09-03 19:56:18,098 INFO L439 ceAbstractionStarter]: At program point L766(lines 254 767) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 41) (<= 41 main_~main__x~0) (<= 50 main_~main__y~0)) [2019-09-03 19:56:18,098 INFO L439 ceAbstractionStarter]: At program point L634(lines 320 635) the Hoare annotation is: (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) [2019-09-03 19:56:18,099 INFO L439 ceAbstractionStarter]: At program point L502(lines 386 503) the Hoare annotation is: (and (<= 63 main_~main__x~0) (<= main_~main__y~0 63) (<= main_~main__x~0 63) (<= 63 main_~main__y~0)) [2019-09-03 19:56:18,099 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2019-09-03 19:56:18,099 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 467) no Hoare annotation was computed. [2019-09-03 19:56:18,099 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 599) no Hoare annotation was computed. [2019-09-03 19:56:18,099 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 731) no Hoare annotation was computed. [2019-09-03 19:56:18,099 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 863) no Hoare annotation was computed. [2019-09-03 19:56:18,099 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 995) no Hoare annotation was computed. [2019-09-03 19:56:18,099 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 1127) no Hoare annotation was computed. [2019-09-03 19:56:18,100 INFO L439 ceAbstractionStarter]: At program point L1198(lines 38 1199) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 5) (<= 5 main_~main__x~0) (<= 50 main_~main__y~0)) [2019-09-03 19:56:18,100 INFO L439 ceAbstractionStarter]: At program point L1066(lines 104 1067) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 16) (<= 50 main_~main__y~0) (<= 16 main_~main__x~0)) [2019-09-03 19:56:18,100 INFO L439 ceAbstractionStarter]: At program point L934(lines 170 935) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 27 main_~main__x~0) (<= main_~main__x~0 27) (<= 50 main_~main__y~0)) [2019-09-03 19:56:18,100 INFO L439 ceAbstractionStarter]: At program point L802(lines 236 803) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 38) (<= 38 main_~main__x~0)) [2019-09-03 19:56:18,100 INFO L439 ceAbstractionStarter]: At program point L670(lines 302 671) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 49 main_~main__x~0) (<= 50 main_~main__y~0) (<= main_~main__x~0 49)) [2019-09-03 19:56:18,100 INFO L439 ceAbstractionStarter]: At program point L538(lines 368 539) the Hoare annotation is: (and (<= main_~main__x~0 60) (<= 60 main_~main__x~0) (<= 60 main_~main__y~0) (<= main_~main__y~0 60)) [2019-09-03 19:56:18,100 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-09-03 19:56:18,101 INFO L443 ceAbstractionStarter]: For program point L374(lines 374 527) no Hoare annotation was computed. [2019-09-03 19:56:18,101 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 659) no Hoare annotation was computed. [2019-09-03 19:56:18,101 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 791) no Hoare annotation was computed. [2019-09-03 19:56:18,101 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 923) no Hoare annotation was computed. [2019-09-03 19:56:18,101 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 1055) no Hoare annotation was computed. [2019-09-03 19:56:18,101 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 1187) no Hoare annotation was computed. [2019-09-03 19:56:18,101 INFO L439 ceAbstractionStarter]: At program point L1234(lines 20 1235) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= 2 main_~main__x~0) (<= main_~main__x~0 2)) [2019-09-03 19:56:18,101 INFO L439 ceAbstractionStarter]: At program point L1102(lines 86 1103) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 13 main_~main__x~0) (<= 50 main_~main__y~0) (<= main_~main__x~0 13)) [2019-09-03 19:56:18,102 INFO L443 ceAbstractionStarter]: For program point L12(lines 12 1252) no Hoare annotation was computed. [2019-09-03 19:56:18,102 INFO L439 ceAbstractionStarter]: At program point L970(lines 152 971) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 24 main_~main__x~0) (<= 50 main_~main__y~0) (<= main_~main__x~0 24)) [2019-09-03 19:56:18,102 INFO L439 ceAbstractionStarter]: At program point L838(lines 218 839) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 35) (<= 50 main_~main__y~0) (<= 35 main_~main__x~0)) [2019-09-03 19:56:18,102 INFO L439 ceAbstractionStarter]: At program point L706(lines 284 707) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= 46 main_~main__x~0) (<= main_~main__x~0 46)) [2019-09-03 19:56:18,102 INFO L439 ceAbstractionStarter]: At program point L574(lines 350 575) the Hoare annotation is: (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) [2019-09-03 19:56:18,102 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 439) no Hoare annotation was computed. [2019-09-03 19:56:18,102 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 455) no Hoare annotation was computed. [2019-09-03 19:56:18,102 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 587) no Hoare annotation was computed. [2019-09-03 19:56:18,103 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 719) no Hoare annotation was computed. [2019-09-03 19:56:18,103 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 851) no Hoare annotation was computed. [2019-09-03 19:56:18,103 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 983) no Hoare annotation was computed. [2019-09-03 19:56:18,103 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 1115) no Hoare annotation was computed. [2019-09-03 19:56:18,103 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 1247) no Hoare annotation was computed. [2019-09-03 19:56:18,103 INFO L439 ceAbstractionStarter]: At program point L1138(lines 68 1139) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 10 main_~main__x~0) (<= 50 main_~main__y~0) (<= main_~main__x~0 10)) [2019-09-03 19:56:18,103 INFO L439 ceAbstractionStarter]: At program point L1006(lines 134 1007) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 21) (<= 21 main_~main__x~0) (<= 50 main_~main__y~0)) [2019-09-03 19:56:18,103 INFO L439 ceAbstractionStarter]: At program point L874(lines 200 875) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 32) (<= 32 main_~main__x~0)) [2019-09-03 19:56:18,103 INFO L439 ceAbstractionStarter]: At program point L742(lines 266 743) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 43) (<= 50 main_~main__y~0) (<= 43 main_~main__x~0)) [2019-09-03 19:56:18,104 INFO L439 ceAbstractionStarter]: At program point L610(lines 332 611) the Hoare annotation is: (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) [2019-09-03 19:56:18,104 INFO L439 ceAbstractionStarter]: At program point L478(lines 398 479) the Hoare annotation is: (and (<= main_~main__y~0 65) (<= 65 main_~main__y~0) (<= main_~main__x~0 65) (<= 65 main_~main__x~0)) [2019-09-03 19:56:18,104 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 515) no Hoare annotation was computed. [2019-09-03 19:56:18,104 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 647) no Hoare annotation was computed. [2019-09-03 19:56:18,104 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 779) no Hoare annotation was computed. [2019-09-03 19:56:18,104 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 911) no Hoare annotation was computed. [2019-09-03 19:56:18,104 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 1043) no Hoare annotation was computed. [2019-09-03 19:56:18,104 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 1175) no Hoare annotation was computed. [2019-09-03 19:56:18,104 INFO L439 ceAbstractionStarter]: At program point L1174(lines 50 1175) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 7) (<= 7 main_~main__x~0) (<= 50 main_~main__y~0)) [2019-09-03 19:56:18,105 INFO L439 ceAbstractionStarter]: At program point L1042(lines 116 1043) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 18 main_~main__x~0) (<= main_~main__x~0 18) (<= 50 main_~main__y~0)) [2019-09-03 19:56:18,105 INFO L439 ceAbstractionStarter]: At program point L910(lines 182 911) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 29) (<= 29 main_~main__x~0)) [2019-09-03 19:56:18,105 INFO L439 ceAbstractionStarter]: At program point L778(lines 248 779) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 40 main_~main__x~0) (<= main_~main__x~0 40) (<= 50 main_~main__y~0)) [2019-09-03 19:56:18,105 INFO L439 ceAbstractionStarter]: At program point L646(lines 314 647) the Hoare annotation is: (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) [2019-09-03 19:56:18,105 INFO L439 ceAbstractionStarter]: At program point L514(lines 380 515) the Hoare annotation is: (and (<= 62 main_~main__y~0) (<= main_~main__y~0 62) (<= 62 main_~main__x~0) (<= main_~main__x~0 62)) [2019-09-03 19:56:18,105 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 575) no Hoare annotation was computed. [2019-09-03 19:56:18,105 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 707) no Hoare annotation was computed. [2019-09-03 19:56:18,105 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 839) no Hoare annotation was computed. [2019-09-03 19:56:18,106 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 971) no Hoare annotation was computed. [2019-09-03 19:56:18,106 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 1103) no Hoare annotation was computed. [2019-09-03 19:56:18,106 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 1235) no Hoare annotation was computed. [2019-09-03 19:56:18,106 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 428) no Hoare annotation was computed. [2019-09-03 19:56:18,106 INFO L439 ceAbstractionStarter]: At program point L1210(lines 32 1211) the Hoare annotation is: (and (<= main_~main__x~0 4) (<= main_~main__y~0 50) (<= 4 main_~main__x~0) (<= 50 main_~main__y~0)) [2019-09-03 19:56:18,106 INFO L439 ceAbstractionStarter]: At program point L1078(lines 98 1079) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 15) (<= 15 main_~main__x~0)) [2019-09-03 19:56:18,106 INFO L439 ceAbstractionStarter]: At program point L946(lines 164 947) the Hoare annotation is: (and (<= main_~main__x~0 26) (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= 26 main_~main__x~0)) [2019-09-03 19:56:18,106 INFO L439 ceAbstractionStarter]: At program point L814(lines 230 815) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 37) (<= 50 main_~main__y~0) (<= 37 main_~main__x~0)) [2019-09-03 19:56:18,106 INFO L439 ceAbstractionStarter]: At program point L682(lines 296 683) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 48 main_~main__x~0) (<= main_~main__x~0 48) (<= 50 main_~main__y~0)) [2019-09-03 19:56:18,107 INFO L439 ceAbstractionStarter]: At program point L550(lines 362 551) the Hoare annotation is: (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= main_~main__x~0 59) (<= 59 main_~main__y~0)) [2019-09-03 19:56:18,107 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 503) no Hoare annotation was computed. [2019-09-03 19:56:18,107 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 635) no Hoare annotation was computed. [2019-09-03 19:56:18,107 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 767) no Hoare annotation was computed. [2019-09-03 19:56:18,107 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 899) no Hoare annotation was computed. [2019-09-03 19:56:18,107 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 1031) no Hoare annotation was computed. [2019-09-03 19:56:18,107 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 1163) no Hoare annotation was computed. [2019-09-03 19:56:18,107 INFO L439 ceAbstractionStarter]: At program point L1246(lines 14 1247) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= 1 main_~main__x~0) (<= main_~main__x~0 1)) [2019-09-03 19:56:18,108 INFO L439 ceAbstractionStarter]: At program point L1114(lines 80 1115) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= 12 main_~main__x~0) (<= main_~main__x~0 12)) [2019-09-03 19:56:18,108 INFO L439 ceAbstractionStarter]: At program point L982(lines 146 983) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 23) (<= 23 main_~main__x~0) (<= 50 main_~main__y~0)) [2019-09-03 19:56:18,108 INFO L439 ceAbstractionStarter]: At program point L850(lines 212 851) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 34) (<= 50 main_~main__y~0) (<= 34 main_~main__x~0)) [2019-09-03 19:56:18,108 INFO L439 ceAbstractionStarter]: At program point L718(lines 278 719) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 45) (<= 50 main_~main__y~0) (<= 45 main_~main__x~0)) [2019-09-03 19:56:18,108 INFO L439 ceAbstractionStarter]: At program point L586(lines 344 587) the Hoare annotation is: (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) [2019-09-03 19:56:18,109 INFO L439 ceAbstractionStarter]: At program point L454(lines 410 455) the Hoare annotation is: (or (and (<= main_~main__y~0 100) (<= 100 main_~main__x~0) (<= 100 main_~main__y~0)) (and (<= main_~main__x~0 95) (<= main_~main__y~0 95) (<= 95 main_~main__x~0) (<= 95 main_~main__y~0)) (and (<= main_~main__x~0 81) (<= main_~main__y~0 81) (<= 81 main_~main__x~0) (<= 81 main_~main__y~0)) (and (<= 87 main_~main__x~0) (<= main_~main__y~0 87) (<= main_~main__x~0 87) (<= 87 main_~main__y~0)) (and (<= main_~main__x~0 91) (<= 91 main_~main__x~0) (<= main_~main__y~0 91) (<= 91 main_~main__y~0)) (and (<= 75 main_~main__y~0) (<= main_~main__x~0 75) (<= 75 main_~main__x~0) (<= main_~main__y~0 75)) (and (<= main_~main__x~0 73) (<= 73 main_~main__x~0) (<= main_~main__y~0 73) (<= 73 main_~main__y~0)) (and (<= main_~main__x~0 96) (<= main_~main__y~0 96) (<= 96 main_~main__y~0) (<= 96 main_~main__x~0)) (and (<= main_~main__x~0 78) (<= main_~main__y~0 78) (<= 78 main_~main__x~0) (<= 78 main_~main__y~0)) (and (<= main_~main__y~0 77) (<= 77 main_~main__y~0) (<= main_~main__x~0 77) (<= 77 main_~main__x~0)) (and (<= main_~main__x~0 92) (<= 92 main_~main__x~0) (<= main_~main__y~0 92) (<= 92 main_~main__y~0)) (and (<= 79 main_~main__x~0) (<= 79 main_~main__y~0) (<= main_~main__x~0 79) (<= main_~main__y~0 79)) (and (<= main_~main__x~0 69) (<= main_~main__y~0 69) (<= 69 main_~main__y~0) (<= 69 main_~main__x~0)) (and (<= main_~main__x~0 93) (<= main_~main__y~0 93) (<= 93 main_~main__y~0) (<= 93 main_~main__x~0)) (and (<= 89 main_~main__y~0) (<= main_~main__y~0 89) (<= main_~main__x~0 89) (<= 89 main_~main__x~0)) (and (<= main_~main__x~0 82) (<= 82 main_~main__x~0) (<= main_~main__y~0 82) (<= 82 main_~main__y~0)) (and (<= main_~main__y~0 90) (<= 90 main_~main__y~0) (<= 90 main_~main__x~0) (<= main_~main__x~0 90)) (and (<= 86 main_~main__x~0) (<= main_~main__x~0 86) (<= main_~main__y~0 86) (<= 86 main_~main__y~0)) (and (<= main_~main__y~0 98) (<= 98 main_~main__y~0) (<= main_~main__x~0 98) (<= 98 main_~main__x~0)) (and (<= main_~main__x~0 99) (<= 99 main_~main__x~0) (<= main_~main__y~0 99) (<= 99 main_~main__y~0)) (and (<= 72 main_~main__x~0) (<= main_~main__y~0 72) (<= 72 main_~main__y~0) (<= main_~main__x~0 72)) (and (<= main_~main__x~0 88) (<= 88 main_~main__x~0) (<= main_~main__y~0 88) (<= 88 main_~main__y~0)) (and (<= main_~main__x~0 94) (<= 94 main_~main__x~0) (<= main_~main__y~0 94) (<= 94 main_~main__y~0)) (and (<= 70 main_~main__x~0) (<= main_~main__y~0 70) (<= main_~main__x~0 70) (<= 70 main_~main__y~0)) (and (<= main_~main__y~0 71) (<= 71 main_~main__y~0) (<= 71 main_~main__x~0) (<= main_~main__x~0 71)) (and (<= 76 main_~main__x~0) (<= main_~main__x~0 76) (<= main_~main__y~0 76) (<= 76 main_~main__y~0)) (and (<= main_~main__y~0 74) (<= 74 main_~main__y~0) (<= main_~main__x~0 74) (<= 74 main_~main__x~0)) (and (<= main_~main__x~0 80) (<= main_~main__y~0 80) (<= 80 main_~main__x~0) (<= 80 main_~main__y~0)) (and (<= 85 main_~main__y~0) (<= main_~main__x~0 85) (<= 85 main_~main__x~0) (<= main_~main__y~0 85)) (and (<= main_~main__y~0 84) (<= 84 main_~main__y~0) (<= 84 main_~main__x~0) (<= main_~main__x~0 84)) (and (<= main_~main__y~0 97) (<= 97 main_~main__x~0) (<= 97 main_~main__y~0) (<= main_~main__x~0 97)) (and (<= main_~main__x~0 67) (<= 67 main_~main__x~0) (<= main_~main__y~0 67) (<= 67 main_~main__y~0)) (and (<= main_~main__y~0 68) (<= 68 main_~main__x~0) (<= main_~main__x~0 68) (<= 68 main_~main__y~0)) (and (<= main_~main__y~0 83) (<= main_~main__x~0 83) (<= 83 main_~main__x~0) (<= 83 main_~main__y~0))) [2019-09-03 19:56:18,109 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 563) no Hoare annotation was computed. [2019-09-03 19:56:18,109 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 695) no Hoare annotation was computed. [2019-09-03 19:56:18,109 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 827) no Hoare annotation was computed. [2019-09-03 19:56:18,109 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 959) no Hoare annotation was computed. [2019-09-03 19:56:18,109 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 1091) no Hoare annotation was computed. [2019-09-03 19:56:18,109 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 1223) no Hoare annotation was computed. [2019-09-03 19:56:18,110 INFO L439 ceAbstractionStarter]: At program point L1150(lines 62 1151) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 9) (<= 50 main_~main__y~0) (<= 9 main_~main__x~0)) [2019-09-03 19:56:18,110 INFO L439 ceAbstractionStarter]: At program point L1018(lines 128 1019) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 20) (<= 20 main_~main__x~0) (<= 50 main_~main__y~0)) [2019-09-03 19:56:18,110 INFO L439 ceAbstractionStarter]: At program point L886(lines 194 887) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= 31 main_~main__x~0) (<= main_~main__x~0 31)) [2019-09-03 19:56:18,110 INFO L439 ceAbstractionStarter]: At program point L754(lines 260 755) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 42) (<= 42 main_~main__x~0)) [2019-09-03 19:56:18,110 INFO L439 ceAbstractionStarter]: At program point L622(lines 326 623) the Hoare annotation is: (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) [2019-09-03 19:56:18,110 INFO L439 ceAbstractionStarter]: At program point L490(lines 392 491) the Hoare annotation is: (and (<= main_~main__y~0 64) (<= main_~main__x~0 64) (<= 64 main_~main__x~0) (<= 64 main_~main__y~0)) [2019-09-03 19:56:18,110 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 491) no Hoare annotation was computed. [2019-09-03 19:56:18,110 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 623) no Hoare annotation was computed. [2019-09-03 19:56:18,111 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 755) no Hoare annotation was computed. [2019-09-03 19:56:18,111 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 887) no Hoare annotation was computed. [2019-09-03 19:56:18,111 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 1019) no Hoare annotation was computed. [2019-09-03 19:56:18,111 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 1151) no Hoare annotation was computed. [2019-09-03 19:56:18,111 INFO L439 ceAbstractionStarter]: At program point L1186(lines 44 1187) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 6 main_~main__x~0) (<= 50 main_~main__y~0) (<= main_~main__x~0 6)) [2019-09-03 19:56:18,111 INFO L439 ceAbstractionStarter]: At program point L1054(lines 110 1055) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 17 main_~main__x~0) (<= main_~main__x~0 17) (<= 50 main_~main__y~0)) [2019-09-03 19:56:18,111 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 1253) the Hoare annotation is: true [2019-09-03 19:56:18,111 INFO L439 ceAbstractionStarter]: At program point L922(lines 176 923) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= 28 main_~main__x~0) (<= main_~main__x~0 28)) [2019-09-03 19:56:18,111 INFO L439 ceAbstractionStarter]: At program point L790(lines 242 791) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 39 main_~main__x~0) (<= 50 main_~main__y~0) (<= main_~main__x~0 39)) [2019-09-03 19:56:18,111 INFO L439 ceAbstractionStarter]: At program point L658(lines 308 659) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50) (<= 50 main_~main__x~0)) [2019-09-03 19:56:18,111 INFO L439 ceAbstractionStarter]: At program point L526(lines 374 527) the Hoare annotation is: (and (<= 61 main_~main__y~0) (<= 61 main_~main__x~0) (<= main_~main__y~0 61) (<= main_~main__x~0 61)) [2019-09-03 19:56:18,112 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 551) no Hoare annotation was computed. [2019-09-03 19:56:18,112 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 683) no Hoare annotation was computed. [2019-09-03 19:56:18,112 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 815) no Hoare annotation was computed. [2019-09-03 19:56:18,112 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 947) no Hoare annotation was computed. [2019-09-03 19:56:18,112 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 1079) no Hoare annotation was computed. [2019-09-03 19:56:18,112 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 1211) no Hoare annotation was computed. [2019-09-03 19:56:18,112 INFO L439 ceAbstractionStarter]: At program point L1222(lines 26 1223) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= 3 main_~main__x~0) (<= main_~main__x~0 3)) [2019-09-03 19:56:18,112 INFO L439 ceAbstractionStarter]: At program point L1090(lines 92 1091) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 14 main_~main__x~0) (<= 50 main_~main__y~0) (<= main_~main__x~0 14)) [2019-09-03 19:56:18,112 INFO L439 ceAbstractionStarter]: At program point L958(lines 158 959) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 25) (<= 25 main_~main__x~0) (<= 50 main_~main__y~0)) [2019-09-03 19:56:18,112 INFO L439 ceAbstractionStarter]: At program point L826(lines 224 827) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 36) (<= 50 main_~main__y~0) (<= 36 main_~main__x~0)) [2019-09-03 19:56:18,112 INFO L439 ceAbstractionStarter]: At program point L694(lines 290 695) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 47) (<= 50 main_~main__y~0) (<= 47 main_~main__x~0)) [2019-09-03 19:56:18,112 INFO L439 ceAbstractionStarter]: At program point L562(lines 356 563) the Hoare annotation is: (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0)) [2019-09-03 19:56:18,113 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 479) no Hoare annotation was computed. [2019-09-03 19:56:18,113 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 611) no Hoare annotation was computed. [2019-09-03 19:56:18,113 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 743) no Hoare annotation was computed. [2019-09-03 19:56:18,113 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 875) no Hoare annotation was computed. [2019-09-03 19:56:18,113 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 1007) no Hoare annotation was computed. [2019-09-03 19:56:18,113 INFO L443 ceAbstractionStarter]: For program point L68(lines 68 1139) no Hoare annotation was computed. [2019-09-03 19:56:18,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:56:18 BoogieIcfgContainer [2019-09-03 19:56:18,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:56:18,163 INFO L168 Benchmark]: Toolchain (without parser) took 228874.65 ms. Allocated memory was 134.2 MB in the beginning and 435.2 MB in the end (delta: 300.9 MB). Free memory was 89.1 MB in the beginning and 48.4 MB in the end (delta: 40.7 MB). Peak memory consumption was 341.7 MB. Max. memory is 7.1 GB. [2019-09-03 19:56:18,164 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:56:18,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 634.90 ms. Allocated memory was 134.2 MB in the beginning and 199.8 MB in the end (delta: 65.5 MB). Free memory was 88.9 MB in the beginning and 172.0 MB in the end (delta: -83.1 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2019-09-03 19:56:18,165 INFO L168 Benchmark]: Boogie Preprocessor took 91.84 ms. Allocated memory is still 199.8 MB. Free memory was 172.0 MB in the beginning and 169.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-09-03 19:56:18,165 INFO L168 Benchmark]: RCFGBuilder took 930.41 ms. Allocated memory is still 199.8 MB. Free memory was 169.5 MB in the beginning and 106.8 MB in the end (delta: 62.6 MB). Peak memory consumption was 62.6 MB. Max. memory is 7.1 GB. [2019-09-03 19:56:18,166 INFO L168 Benchmark]: TraceAbstraction took 227212.65 ms. Allocated memory was 199.8 MB in the beginning and 435.2 MB in the end (delta: 235.4 MB). Free memory was 106.8 MB in the beginning and 48.4 MB in the end (delta: 58.4 MB). Peak memory consumption was 293.8 MB. Max. memory is 7.1 GB. [2019-09-03 19:56:18,169 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 634.90 ms. Allocated memory was 134.2 MB in the beginning and 199.8 MB in the end (delta: 65.5 MB). Free memory was 88.9 MB in the beginning and 172.0 MB in the end (delta: -83.1 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 91.84 ms. Allocated memory is still 199.8 MB. Free memory was 172.0 MB in the beginning and 169.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 930.41 ms. Allocated memory is still 199.8 MB. Free memory was 169.5 MB in the beginning and 106.8 MB in the end (delta: 62.6 MB). Peak memory consumption was 62.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 227212.65 ms. Allocated memory was 199.8 MB in the beginning and 435.2 MB in the end (delta: 235.4 MB). Free memory was 106.8 MB in the beginning and 48.4 MB in the end (delta: 58.4 MB). Peak memory consumption was 293.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 439]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 8) && 8 <= main__x) && 50 <= main__y - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 40 <= main__x) && main__x <= 40) && 50 <= main__y - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && 1 <= main__x) && main__x <= 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((33 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 33 - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((61 <= main__y && 61 <= main__x) && main__y <= 61) && main__x <= 61 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((main__x <= 26 && main__y <= 50) && 50 <= main__y) && 26 <= main__x - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 19) && 50 <= main__y) && 19 <= main__x - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51 - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && 12 <= main__x) && main__x <= 12 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 44 <= main__x) && 50 <= main__y) && main__x <= 44 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 5) && 5 <= main__x) && 50 <= main__y - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 37) && 50 <= main__y) && 37 <= main__x - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 30) && 50 <= main__y) && 30 <= main__x - InvariantResult [Line: 392]: Loop Invariant Derived loop invariant: ((main__y <= 64 && main__x <= 64) && 64 <= main__x) && 64 <= main__y - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 23) && 23 <= main__x) && 50 <= main__y - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 16) && 50 <= main__y) && 16 <= main__x - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 48 <= main__x) && main__x <= 48) && 50 <= main__y - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 9) && 50 <= main__y) && 9 <= main__x - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 41) && 41 <= main__x) && 50 <= main__y - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && 2 <= main__x) && main__x <= 2 - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 34) && 50 <= main__y) && 34 <= main__x - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((main__x <= 60 && 60 <= main__x) && 60 <= main__y) && main__y <= 60 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 27 <= main__x) && main__x <= 27) && 50 <= main__y - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((main__y <= 100 && 100 <= main__x) && 100 <= main__y) || (((main__x <= 95 && main__y <= 95) && 95 <= main__x) && 95 <= main__y)) || (((main__x <= 81 && main__y <= 81) && 81 <= main__x) && 81 <= main__y)) || (((87 <= main__x && main__y <= 87) && main__x <= 87) && 87 <= main__y)) || (((main__x <= 91 && 91 <= main__x) && main__y <= 91) && 91 <= main__y)) || (((75 <= main__y && main__x <= 75) && 75 <= main__x) && main__y <= 75)) || (((main__x <= 73 && 73 <= main__x) && main__y <= 73) && 73 <= main__y)) || (((main__x <= 96 && main__y <= 96) && 96 <= main__y) && 96 <= main__x)) || (((main__x <= 78 && main__y <= 78) && 78 <= main__x) && 78 <= main__y)) || (((main__y <= 77 && 77 <= main__y) && main__x <= 77) && 77 <= main__x)) || (((main__x <= 92 && 92 <= main__x) && main__y <= 92) && 92 <= main__y)) || (((79 <= main__x && 79 <= main__y) && main__x <= 79) && main__y <= 79)) || (((main__x <= 69 && main__y <= 69) && 69 <= main__y) && 69 <= main__x)) || (((main__x <= 93 && main__y <= 93) && 93 <= main__y) && 93 <= main__x)) || (((89 <= main__y && main__y <= 89) && main__x <= 89) && 89 <= main__x)) || (((main__x <= 82 && 82 <= main__x) && main__y <= 82) && 82 <= main__y)) || (((main__y <= 90 && 90 <= main__y) && 90 <= main__x) && main__x <= 90)) || (((86 <= main__x && main__x <= 86) && main__y <= 86) && 86 <= main__y)) || (((main__y <= 98 && 98 <= main__y) && main__x <= 98) && 98 <= main__x)) || (((main__x <= 99 && 99 <= main__x) && main__y <= 99) && 99 <= main__y)) || (((72 <= main__x && main__y <= 72) && 72 <= main__y) && main__x <= 72)) || (((main__x <= 88 && 88 <= main__x) && main__y <= 88) && 88 <= main__y)) || (((main__x <= 94 && 94 <= main__x) && main__y <= 94) && 94 <= main__y)) || (((70 <= main__x && main__y <= 70) && main__x <= 70) && 70 <= main__y)) || (((main__y <= 71 && 71 <= main__y) && 71 <= main__x) && main__x <= 71)) || (((76 <= main__x && main__x <= 76) && main__y <= 76) && 76 <= main__y)) || (((main__y <= 74 && 74 <= main__y) && main__x <= 74) && 74 <= main__x)) || (((main__x <= 80 && main__y <= 80) && 80 <= main__x) && 80 <= main__y)) || (((85 <= main__y && main__x <= 85) && 85 <= main__x) && main__y <= 85)) || (((main__y <= 84 && 84 <= main__y) && 84 <= main__x) && main__x <= 84)) || (((main__y <= 97 && 97 <= main__x) && 97 <= main__y) && main__x <= 97)) || (((main__x <= 67 && 67 <= main__x) && main__y <= 67) && 67 <= main__y)) || (((main__y <= 68 && 68 <= main__x) && main__x <= 68) && 68 <= main__y)) || (((main__y <= 83 && main__x <= 83) && 83 <= main__x) && 83 <= main__y) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 20) && 20 <= main__x) && 50 <= main__y - InvariantResult [Line: 320]: Loop Invariant Derived loop invariant: ((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 13 <= main__x) && 50 <= main__y) && main__x <= 13 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 45) && 50 <= main__y) && 45 <= main__x - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 6 <= main__x) && 50 <= main__y) && main__x <= 6 - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 38) && 38 <= main__x - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && 31 <= main__x) && main__x <= 31 - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((63 <= main__x && main__y <= 63) && main__x <= 63) && 63 <= main__y - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 24 <= main__x) && 50 <= main__y) && main__x <= 24 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 17 <= main__x) && main__x <= 17) && 50 <= main__y - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 49 <= main__x) && 50 <= main__y) && main__x <= 49 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 10 <= main__x) && 50 <= main__y) && main__x <= 10 - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 42) && 42 <= main__x - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && 3 <= main__x) && main__x <= 3 - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 35) && 50 <= main__y) && 35 <= main__x - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: ((59 <= main__x && main__y <= 59) && main__x <= 59) && 59 <= main__y - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && 28 <= main__x) && main__x <= 28 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((main__x <= 66 && main__y <= 66) && 66 <= main__y) && 66 <= main__x - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 21) && 21 <= main__x) && 50 <= main__y - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 14 <= main__x) && 50 <= main__y) && main__x <= 14 - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && 46 <= main__x) && main__x <= 46 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 7) && 7 <= main__x) && 50 <= main__y - InvariantResult [Line: 242]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 39 <= main__x) && 50 <= main__y) && main__x <= 39 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 32) && 32 <= main__x - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: ((62 <= main__y && main__y <= 62) && 62 <= main__x) && main__x <= 62 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 25) && 25 <= main__x) && 50 <= main__y - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 18 <= main__x) && main__x <= 18) && 50 <= main__y - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 50) && 50 <= main__x - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 11) && 50 <= main__y) && 11 <= main__x - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 43) && 50 <= main__y) && 43 <= main__x - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((main__x <= 4 && main__y <= 50) && 4 <= main__x) && 50 <= main__y - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 36) && 50 <= main__y) && 36 <= main__x - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 29) && 29 <= main__x - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((main__y <= 65 && 65 <= main__y) && main__x <= 65) && 65 <= main__x - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 22) && 22 <= main__x - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 15) && 15 <= main__x - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 47) && 50 <= main__y) && 47 <= main__x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 149 locations, 1 error locations. SAFE Result, 227.0s OverallTime, 62 OverallIterations, 34 TraceHistogramMax, 119.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 4132 SDtfs, 7253 SDslu, 21703 SDs, 0 SdLazy, 202286 SolverSat, 6846 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 92.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9499 GetRequests, 5930 SyntacticMatches, 1 SemanticMatches, 3568 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 95.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 62 MinimizatonAttempts, 35 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 71 PreInvPairs, 171 NumberOfFragments, 1302 HoareAnnotationTreeSize, 71 FomulaSimplifications, 8 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 71 FomulaSimplificationsInter, 297 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 99.3s InterpolantComputationTime, 15897 NumberOfCodeBlocks, 15897 NumberOfCodeBlocksAsserted, 389 NumberOfCheckSat, 15802 ConstructedInterpolants, 0 QuantifiedInterpolants, 7459604 SizeOfPredicates, 35 NumberOfNonLiveVariables, 14454 ConjunctsInSsa, 2844 ConjunctsInUnsatCore, 95 InterpolantComputations, 29 PerfectInterpolantSequences, 1156/26214 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...