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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:01:16,209 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:01:16,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:01:16,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:01:16,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:01:16,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:01:16,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:01:16,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:01:16,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:01:16,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:01:16,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:01:16,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:01:16,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:01:16,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:01:16,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:01:16,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:01:16,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:01:16,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:01:16,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:01:16,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:01:16,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:01:16,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:01:16,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:01:16,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:01:16,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:01:16,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:01:16,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:01:16,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:01:16,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:01:16,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:01:16,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:01:16,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:01:16,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:01:16,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:01:16,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:01:16,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:01:16,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:01:16,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:01:16,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:01:16,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:01:16,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:01:16,276 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 09:01:16,292 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:01:16,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:01:16,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:01:16,293 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:01:16,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:01:16,294 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:01:16,294 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:01:16,294 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:01:16,294 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:01:16,294 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:01:16,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:01:16,295 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:01:16,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:01:16,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:01:16,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:01:16,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:01:16,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:01:16,297 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:01:16,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:01:16,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:01:16,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:01:16,298 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:01:16,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:01:16,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:01:16,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:01:16,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:01:16,299 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:01:16,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:01:16,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:01:16,299 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:01:16,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:01:16,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:01:16,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:01:16,349 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:01:16,350 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:01:16,351 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 09:01:16,415 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d29bf3b/5753f59601cf4ee38c6c5a57599643bd/FLAG5f2159753 [2019-09-10 09:01:17,365 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:01:17,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 09:01:17,423 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d29bf3b/5753f59601cf4ee38c6c5a57599643bd/FLAG5f2159753 [2019-09-10 09:01:17,804 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d29bf3b/5753f59601cf4ee38c6c5a57599643bd [2019-09-10 09:01:17,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:01:17,814 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:01:17,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:01:17,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:01:17,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:01:17,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:01:17" (1/1) ... [2019-09-10 09:01:17,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ffd4eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:17, skipping insertion in model container [2019-09-10 09:01:17,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:01:17" (1/1) ... [2019-09-10 09:01:17,831 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:01:18,378 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:01:22,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:01:22,811 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:01:25,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:01:25,905 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:01:25,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:25 WrapperNode [2019-09-10 09:01:25,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:01:25,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:01:25,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:01:25,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:01:25,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:25" (1/1) ... [2019-09-10 09:01:25,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:25" (1/1) ... [2019-09-10 09:01:26,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:25" (1/1) ... [2019-09-10 09:01:26,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:25" (1/1) ... [2019-09-10 09:01:26,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:25" (1/1) ... [2019-09-10 09:01:26,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:25" (1/1) ... [2019-09-10 09:01:26,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:25" (1/1) ... [2019-09-10 09:01:26,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:01:26,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:01:26,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:01:26,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:01:26,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:01:26,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:01:26,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:01:26,520 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:01:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:01:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:01:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:01:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:01:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:01:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:01:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:01:26,522 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:01:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:01:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:01:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:01:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 09:01:26,686 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:01:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:01:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:01:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:01:26,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:01:41,738 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:01:41,738 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:01:41,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:01:41 BoogieIcfgContainer [2019-09-10 09:01:41,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:01:41,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:01:41,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:01:41,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:01:41,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:01:17" (1/3) ... [2019-09-10 09:01:41,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20083595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:01:41, skipping insertion in model container [2019-09-10 09:01:41,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:01:25" (2/3) ... [2019-09-10 09:01:41,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20083595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:01:41, skipping insertion in model container [2019-09-10 09:01:41,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:01:41" (3/3) ... [2019-09-10 09:01:41,749 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 09:01:41,758 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:01:41,769 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 09:01:41,788 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 09:01:41,817 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:01:41,817 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:01:41,817 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:01:41,817 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:01:41,817 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:01:41,818 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:01:41,818 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:01:41,818 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:01:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 6849 states. [2019-09-10 09:01:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 09:01:41,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:42,001 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:42,004 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:42,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:42,011 INFO L82 PathProgramCache]: Analyzing trace with hash -744909770, now seen corresponding path program 1 times [2019-09-10 09:01:42,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:42,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:42,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:42,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:42,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:43,113 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-10 09:01:43,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:43,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:43,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:43,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:43,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:43,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:43,146 INFO L87 Difference]: Start difference. First operand 6849 states. Second operand 3 states. [2019-09-10 09:01:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:43,760 INFO L93 Difference]: Finished difference Result 8196 states and 14201 transitions. [2019-09-10 09:01:43,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:43,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-10 09:01:43,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:43,837 INFO L225 Difference]: With dead ends: 8196 [2019-09-10 09:01:43,837 INFO L226 Difference]: Without dead ends: 8188 [2019-09-10 09:01:43,840 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-10 09:01:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8188 states. [2019-09-10 09:01:44,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8188 to 8186. [2019-09-10 09:01:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8186 states. [2019-09-10 09:01:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8186 states to 8186 states and 13709 transitions. [2019-09-10 09:01:44,167 INFO L78 Accepts]: Start accepts. Automaton has 8186 states and 13709 transitions. Word has length 372 [2019-09-10 09:01:44,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:44,170 INFO L475 AbstractCegarLoop]: Abstraction has 8186 states and 13709 transitions. [2019-09-10 09:01:44,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:44,171 INFO L276 IsEmpty]: Start isEmpty. Operand 8186 states and 13709 transitions. [2019-09-10 09:01:44,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 09:01:44,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:44,200 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:44,201 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:44,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:44,202 INFO L82 PathProgramCache]: Analyzing trace with hash -507662624, now seen corresponding path program 1 times [2019-09-10 09:01:44,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:44,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:44,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:44,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:44,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:44,869 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-10 09:01:44,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:44,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:44,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:44,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:44,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:44,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:44,876 INFO L87 Difference]: Start difference. First operand 8186 states and 13709 transitions. Second operand 3 states. [2019-09-10 09:01:45,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:45,624 INFO L93 Difference]: Finished difference Result 10875 states and 18185 transitions. [2019-09-10 09:01:45,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:45,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-10 09:01:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:45,685 INFO L225 Difference]: With dead ends: 10875 [2019-09-10 09:01:45,685 INFO L226 Difference]: Without dead ends: 10875 [2019-09-10 09:01:45,687 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-10 09:01:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10875 states. [2019-09-10 09:01:45,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10875 to 10873. [2019-09-10 09:01:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10873 states. [2019-09-10 09:01:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10873 states to 10873 states and 18184 transitions. [2019-09-10 09:01:46,001 INFO L78 Accepts]: Start accepts. Automaton has 10873 states and 18184 transitions. Word has length 372 [2019-09-10 09:01:46,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:46,002 INFO L475 AbstractCegarLoop]: Abstraction has 10873 states and 18184 transitions. [2019-09-10 09:01:46,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 10873 states and 18184 transitions. [2019-09-10 09:01:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 09:01:46,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:46,041 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:46,042 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:46,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:46,043 INFO L82 PathProgramCache]: Analyzing trace with hash 984938430, now seen corresponding path program 1 times [2019-09-10 09:01:46,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:46,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:46,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:46,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:46,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:46,457 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-10 09:01:46,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:46,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:46,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:46,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:46,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:46,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:46,461 INFO L87 Difference]: Start difference. First operand 10873 states and 18184 transitions. Second operand 3 states. [2019-09-10 09:01:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:47,361 INFO L93 Difference]: Finished difference Result 17215 states and 28783 transitions. [2019-09-10 09:01:47,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:47,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-10 09:01:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:47,430 INFO L225 Difference]: With dead ends: 17215 [2019-09-10 09:01:47,430 INFO L226 Difference]: Without dead ends: 17215 [2019-09-10 09:01:47,431 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-10 09:01:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17215 states. [2019-09-10 09:01:48,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17215 to 17213. [2019-09-10 09:01:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17213 states. [2019-09-10 09:01:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17213 states to 17213 states and 28782 transitions. [2019-09-10 09:01:48,060 INFO L78 Accepts]: Start accepts. Automaton has 17213 states and 28782 transitions. Word has length 372 [2019-09-10 09:01:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:48,061 INFO L475 AbstractCegarLoop]: Abstraction has 17213 states and 28782 transitions. [2019-09-10 09:01:48,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 17213 states and 28782 transitions. [2019-09-10 09:01:48,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 09:01:48,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:48,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:48,114 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:48,114 INFO L82 PathProgramCache]: Analyzing trace with hash -578792770, now seen corresponding path program 1 times [2019-09-10 09:01:48,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:48,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:48,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:48,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:48,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:48,441 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-10 09:01:48,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:48,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:48,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:48,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:48,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:48,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:48,443 INFO L87 Difference]: Start difference. First operand 17213 states and 28782 transitions. Second operand 3 states. [2019-09-10 09:01:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:49,216 INFO L93 Difference]: Finished difference Result 18077 states and 30100 transitions. [2019-09-10 09:01:49,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:49,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-10 09:01:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:49,264 INFO L225 Difference]: With dead ends: 18077 [2019-09-10 09:01:49,265 INFO L226 Difference]: Without dead ends: 18077 [2019-09-10 09:01:49,265 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-10 09:01:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18077 states. [2019-09-10 09:01:49,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18077 to 17981. [2019-09-10 09:01:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17981 states. [2019-09-10 09:01:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17981 states to 17981 states and 30005 transitions. [2019-09-10 09:01:49,609 INFO L78 Accepts]: Start accepts. Automaton has 17981 states and 30005 transitions. Word has length 372 [2019-09-10 09:01:49,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:49,610 INFO L475 AbstractCegarLoop]: Abstraction has 17981 states and 30005 transitions. [2019-09-10 09:01:49,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 17981 states and 30005 transitions. [2019-09-10 09:01:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 09:01:49,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:49,657 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:49,657 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:49,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:49,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1174873915, now seen corresponding path program 1 times [2019-09-10 09:01:49,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:49,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:49,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:49,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:49,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:52,287 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-10 09:01:52,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:52,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:01:52,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:52,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:01:52,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:01:52,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:01:52,290 INFO L87 Difference]: Start difference. First operand 17981 states and 30005 transitions. Second operand 4 states. [2019-09-10 09:01:52,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:52,744 INFO L93 Difference]: Finished difference Result 28164 states and 46973 transitions. [2019-09-10 09:01:52,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 09:01:52,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 372 [2019-09-10 09:01:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:52,814 INFO L225 Difference]: With dead ends: 28164 [2019-09-10 09:01:52,815 INFO L226 Difference]: Without dead ends: 28164 [2019-09-10 09:01:52,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:01:52,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28164 states. [2019-09-10 09:01:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28164 to 26442. [2019-09-10 09:01:53,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26442 states. [2019-09-10 09:01:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26442 states to 26442 states and 44064 transitions. [2019-09-10 09:01:53,313 INFO L78 Accepts]: Start accepts. Automaton has 26442 states and 44064 transitions. Word has length 372 [2019-09-10 09:01:53,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:53,314 INFO L475 AbstractCegarLoop]: Abstraction has 26442 states and 44064 transitions. [2019-09-10 09:01:53,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:01:53,314 INFO L276 IsEmpty]: Start isEmpty. Operand 26442 states and 44064 transitions. [2019-09-10 09:01:53,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 09:01:53,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:53,353 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:53,354 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:53,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:53,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1380294817, now seen corresponding path program 1 times [2019-09-10 09:01:53,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:53,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:53,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:53,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:53,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:53,694 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-10 09:01:53,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:53,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:53,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:53,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:53,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:53,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:53,696 INFO L87 Difference]: Start difference. First operand 26442 states and 44064 transitions. Second operand 3 states. [2019-09-10 09:01:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:54,409 INFO L93 Difference]: Finished difference Result 41664 states and 69271 transitions. [2019-09-10 09:01:54,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:54,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-10 09:01:54,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:54,516 INFO L225 Difference]: With dead ends: 41664 [2019-09-10 09:01:54,517 INFO L226 Difference]: Without dead ends: 41664 [2019-09-10 09:01:54,517 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-10 09:01:54,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41664 states. [2019-09-10 09:01:55,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41664 to 41662. [2019-09-10 09:01:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41662 states. [2019-09-10 09:01:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41662 states to 41662 states and 69270 transitions. [2019-09-10 09:01:55,233 INFO L78 Accepts]: Start accepts. Automaton has 41662 states and 69270 transitions. Word has length 372 [2019-09-10 09:01:55,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:55,234 INFO L475 AbstractCegarLoop]: Abstraction has 41662 states and 69270 transitions. [2019-09-10 09:01:55,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:55,234 INFO L276 IsEmpty]: Start isEmpty. Operand 41662 states and 69270 transitions. [2019-09-10 09:01:55,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 09:01:55,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:55,285 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:55,286 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:55,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:55,286 INFO L82 PathProgramCache]: Analyzing trace with hash 967796127, now seen corresponding path program 1 times [2019-09-10 09:01:55,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:55,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:55,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:55,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:55,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:55,718 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-10 09:01:55,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:55,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:55,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:55,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:55,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:55,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:55,722 INFO L87 Difference]: Start difference. First operand 41662 states and 69270 transitions. Second operand 3 states. [2019-09-10 09:01:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:57,869 INFO L93 Difference]: Finished difference Result 74920 states and 124267 transitions. [2019-09-10 09:01:57,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:57,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-10 09:01:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:57,994 INFO L225 Difference]: With dead ends: 74920 [2019-09-10 09:01:57,995 INFO L226 Difference]: Without dead ends: 74920 [2019-09-10 09:01:57,995 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-10 09:01:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74920 states. [2019-09-10 09:01:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74920 to 74918. [2019-09-10 09:01:59,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74918 states. [2019-09-10 09:01:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74918 states to 74918 states and 124266 transitions. [2019-09-10 09:01:59,143 INFO L78 Accepts]: Start accepts. Automaton has 74918 states and 124266 transitions. Word has length 372 [2019-09-10 09:01:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:59,144 INFO L475 AbstractCegarLoop]: Abstraction has 74918 states and 124266 transitions. [2019-09-10 09:01:59,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:59,144 INFO L276 IsEmpty]: Start isEmpty. Operand 74918 states and 124266 transitions. [2019-09-10 09:01:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 09:01:59,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:59,234 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:59,234 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:59,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:59,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1236804319, now seen corresponding path program 1 times [2019-09-10 09:01:59,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:59,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:59,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:59,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:59,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:59,718 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-10 09:01:59,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:59,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:59,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:59,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:59,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:59,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:59,721 INFO L87 Difference]: Start difference. First operand 74918 states and 124266 transitions. Second operand 3 states. [2019-09-10 09:02:00,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:00,315 INFO L93 Difference]: Finished difference Result 87960 states and 146407 transitions. [2019-09-10 09:02:00,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:00,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-10 09:02:00,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:00,489 INFO L225 Difference]: With dead ends: 87960 [2019-09-10 09:02:00,490 INFO L226 Difference]: Without dead ends: 87960 [2019-09-10 09:02:00,490 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-10 09:02:00,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87960 states. [2019-09-10 09:02:01,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87960 to 86222. [2019-09-10 09:02:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86222 states. [2019-09-10 09:02:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86222 states to 86222 states and 143262 transitions. [2019-09-10 09:02:01,852 INFO L78 Accepts]: Start accepts. Automaton has 86222 states and 143262 transitions. Word has length 372 [2019-09-10 09:02:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:01,853 INFO L475 AbstractCegarLoop]: Abstraction has 86222 states and 143262 transitions. [2019-09-10 09:02:01,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 86222 states and 143262 transitions. [2019-09-10 09:02:01,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 09:02:01,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:01,927 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:02:01,928 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:01,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:01,928 INFO L82 PathProgramCache]: Analyzing trace with hash 425696178, now seen corresponding path program 1 times [2019-09-10 09:02:01,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:01,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:01,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:01,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:01,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:04,864 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-10 09:02:04,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:04,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:02:04,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:04,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:02:04,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:02:04,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:02:04,866 INFO L87 Difference]: Start difference. First operand 86222 states and 143262 transitions. Second operand 4 states. [2019-09-10 09:02:06,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:06,509 INFO L93 Difference]: Finished difference Result 147218 states and 245056 transitions. [2019-09-10 09:02:06,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:02:06,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 372 [2019-09-10 09:02:06,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:06,775 INFO L225 Difference]: With dead ends: 147218 [2019-09-10 09:02:06,775 INFO L226 Difference]: Without dead ends: 147218 [2019-09-10 09:02:06,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:02:06,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147218 states. [2019-09-10 09:02:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147218 to 136270. [2019-09-10 09:02:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136270 states. [2019-09-10 09:02:08,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136270 states to 136270 states and 226798 transitions. [2019-09-10 09:02:08,833 INFO L78 Accepts]: Start accepts. Automaton has 136270 states and 226798 transitions. Word has length 372 [2019-09-10 09:02:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:08,834 INFO L475 AbstractCegarLoop]: Abstraction has 136270 states and 226798 transitions. [2019-09-10 09:02:08,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:02:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand 136270 states and 226798 transitions. [2019-09-10 09:02:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-10 09:02:08,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:08,927 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:02:08,928 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:08,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:08,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1763988798, now seen corresponding path program 1 times [2019-09-10 09:02:08,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:08,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:08,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:08,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:08,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:09,538 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-10 09:02:09,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:09,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:09,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:09,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:09,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:09,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:09,542 INFO L87 Difference]: Start difference. First operand 136270 states and 226798 transitions. Second operand 3 states. [2019-09-10 09:02:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:10,295 INFO L93 Difference]: Finished difference Result 235068 states and 389713 transitions. [2019-09-10 09:02:10,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:10,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-09-10 09:02:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:10,749 INFO L225 Difference]: With dead ends: 235068 [2019-09-10 09:02:10,749 INFO L226 Difference]: Without dead ends: 235068 [2019-09-10 09:02:10,749 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-10 09:02:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235068 states. [2019-09-10 09:02:16,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235068 to 220402. [2019-09-10 09:02:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220402 states. [2019-09-10 09:02:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220402 states to 220402 states and 365704 transitions. [2019-09-10 09:02:18,061 INFO L78 Accepts]: Start accepts. Automaton has 220402 states and 365704 transitions. Word has length 376 [2019-09-10 09:02:18,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:18,061 INFO L475 AbstractCegarLoop]: Abstraction has 220402 states and 365704 transitions. [2019-09-10 09:02:18,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 220402 states and 365704 transitions. [2019-09-10 09:02:18,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-10 09:02:18,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:18,228 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:02:18,228 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:18,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:18,229 INFO L82 PathProgramCache]: Analyzing trace with hash -652451507, now seen corresponding path program 1 times [2019-09-10 09:02:18,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:18,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:18,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:18,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:18,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:18,671 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-10 09:02:18,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:18,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:18,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:18,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:18,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:18,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:18,674 INFO L87 Difference]: Start difference. First operand 220402 states and 365704 transitions. Second operand 3 states. [2019-09-10 09:02:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:19,417 INFO L93 Difference]: Finished difference Result 220404 states and 365141 transitions. [2019-09-10 09:02:19,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:19,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-09-10 09:02:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:19,665 INFO L225 Difference]: With dead ends: 220404 [2019-09-10 09:02:19,666 INFO L226 Difference]: Without dead ends: 220404 [2019-09-10 09:02:19,666 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-10 09:02:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220404 states. [2019-09-10 09:02:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220404 to 220402. [2019-09-10 09:02:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220402 states. [2019-09-10 09:02:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220402 states to 220402 states and 365140 transitions. [2019-09-10 09:02:26,214 INFO L78 Accepts]: Start accepts. Automaton has 220402 states and 365140 transitions. Word has length 376 [2019-09-10 09:02:26,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:26,214 INFO L475 AbstractCegarLoop]: Abstraction has 220402 states and 365140 transitions. [2019-09-10 09:02:26,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:26,215 INFO L276 IsEmpty]: Start isEmpty. Operand 220402 states and 365140 transitions. [2019-09-10 09:02:26,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-10 09:02:26,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:26,401 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:02:26,401 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:26,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:26,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1401984827, now seen corresponding path program 1 times [2019-09-10 09:02:26,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:26,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:26,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:26,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:26,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:26,836 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-10 09:02:26,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:26,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:26,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:26,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:26,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:26,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:26,839 INFO L87 Difference]: Start difference. First operand 220402 states and 365140 transitions. Second operand 3 states. [2019-09-10 09:02:27,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:27,375 INFO L93 Difference]: Finished difference Result 94372 states and 156909 transitions. [2019-09-10 09:02:27,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:27,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-09-10 09:02:27,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:27,492 INFO L225 Difference]: With dead ends: 94372 [2019-09-10 09:02:27,492 INFO L226 Difference]: Without dead ends: 94372 [2019-09-10 09:02:27,493 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-10 09:02:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94372 states. [2019-09-10 09:02:29,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94372 to 78402. [2019-09-10 09:02:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78402 states. [2019-09-10 09:02:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78402 states to 78402 states and 130316 transitions. [2019-09-10 09:02:29,462 INFO L78 Accepts]: Start accepts. Automaton has 78402 states and 130316 transitions. Word has length 376 [2019-09-10 09:02:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:29,462 INFO L475 AbstractCegarLoop]: Abstraction has 78402 states and 130316 transitions. [2019-09-10 09:02:29,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 78402 states and 130316 transitions. [2019-09-10 09:02:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-10 09:02:29,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:29,513 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:02:29,514 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:29,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:29,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2110471814, now seen corresponding path program 1 times [2019-09-10 09:02:29,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:29,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:29,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:29,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:29,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:29,954 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-10 09:02:29,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:29,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:02:29,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:29,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:02:29,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:02:29,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:02:29,957 INFO L87 Difference]: Start difference. First operand 78402 states and 130316 transitions. Second operand 3 states. [2019-09-10 09:02:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:30,512 INFO L93 Difference]: Finished difference Result 111780 states and 184749 transitions. [2019-09-10 09:02:30,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:02:30,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2019-09-10 09:02:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:30,667 INFO L225 Difference]: With dead ends: 111780 [2019-09-10 09:02:30,667 INFO L226 Difference]: Without dead ends: 111780 [2019-09-10 09:02:30,667 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-10 09:02:30,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111780 states. [2019-09-10 09:02:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111780 to 111522. [2019-09-10 09:02:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111522 states. [2019-09-10 09:02:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111522 states to 111522 states and 184492 transitions. [2019-09-10 09:02:34,380 INFO L78 Accepts]: Start accepts. Automaton has 111522 states and 184492 transitions. Word has length 376 [2019-09-10 09:02:34,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:34,381 INFO L475 AbstractCegarLoop]: Abstraction has 111522 states and 184492 transitions. [2019-09-10 09:02:34,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 111522 states and 184492 transitions. [2019-09-10 09:02:34,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-10 09:02:34,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:34,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:02:34,421 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:34,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:34,422 INFO L82 PathProgramCache]: Analyzing trace with hash 454188724, now seen corresponding path program 1 times [2019-09-10 09:02:34,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:34,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:34,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:34,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:34,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:35,072 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-10 09:02:35,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:35,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:02:35,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:35,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:02:35,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:02:35,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:02:35,074 INFO L87 Difference]: Start difference. First operand 111522 states and 184492 transitions. Second operand 5 states. [2019-09-10 09:02:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:35,624 INFO L93 Difference]: Finished difference Result 134266 states and 221358 transitions. [2019-09-10 09:02:35,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:02:35,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 377 [2019-09-10 09:02:35,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:35,826 INFO L225 Difference]: With dead ends: 134266 [2019-09-10 09:02:35,826 INFO L226 Difference]: Without dead ends: 134266 [2019-09-10 09:02:35,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:02:35,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134266 states. [2019-09-10 09:02:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134266 to 118342. [2019-09-10 09:02:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118342 states. [2019-09-10 09:02:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118342 states to 118342 states and 195132 transitions. [2019-09-10 09:02:37,612 INFO L78 Accepts]: Start accepts. Automaton has 118342 states and 195132 transitions. Word has length 377 [2019-09-10 09:02:37,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:37,612 INFO L475 AbstractCegarLoop]: Abstraction has 118342 states and 195132 transitions. [2019-09-10 09:02:37,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:02:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 118342 states and 195132 transitions. [2019-09-10 09:02:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-10 09:02:37,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:37,670 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:02:37,670 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:37,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:37,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1627476068, now seen corresponding path program 1 times [2019-09-10 09:02:37,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:37,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:37,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:37,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:37,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:38,220 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-10 09:02:38,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:38,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:02:38,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:38,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:02:38,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:02:38,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:02:38,223 INFO L87 Difference]: Start difference. First operand 118342 states and 195132 transitions. Second operand 6 states. [2019-09-10 09:02:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:39,520 INFO L93 Difference]: Finished difference Result 236280 states and 390507 transitions. [2019-09-10 09:02:39,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:02:39,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 377 [2019-09-10 09:02:39,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:39,865 INFO L225 Difference]: With dead ends: 236280 [2019-09-10 09:02:39,865 INFO L226 Difference]: Without dead ends: 236280 [2019-09-10 09:02:39,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:02:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236280 states. [2019-09-10 09:02:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236280 to 227378. [2019-09-10 09:02:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227378 states. [2019-09-10 09:02:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227378 states to 227378 states and 376360 transitions. [2019-09-10 09:02:45,821 INFO L78 Accepts]: Start accepts. Automaton has 227378 states and 376360 transitions. Word has length 377 [2019-09-10 09:02:45,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:45,821 INFO L475 AbstractCegarLoop]: Abstraction has 227378 states and 376360 transitions. [2019-09-10 09:02:45,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:02:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 227378 states and 376360 transitions. [2019-09-10 09:02:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-10 09:02:45,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:45,883 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:02:45,883 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:45,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:45,883 INFO L82 PathProgramCache]: Analyzing trace with hash -414176259, now seen corresponding path program 1 times [2019-09-10 09:02:45,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:45,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:45,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:45,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:45,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:47,809 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-10 09:02:47,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:47,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 09:02:47,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:47,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 09:02:47,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 09:02:47,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 09:02:47,812 INFO L87 Difference]: Start difference. First operand 227378 states and 376360 transitions. Second operand 8 states. [2019-09-10 09:02:59,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:59,540 INFO L93 Difference]: Finished difference Result 1560252 states and 2568193 transitions. [2019-09-10 09:02:59,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 09:02:59,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 377 [2019-09-10 09:02:59,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:04,521 INFO L225 Difference]: With dead ends: 1560252 [2019-09-10 09:03:04,521 INFO L226 Difference]: Without dead ends: 1560252 [2019-09-10 09:03:04,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-09-10 09:03:05,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560252 states. [2019-09-10 09:03:36,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560252 to 1026480. [2019-09-10 09:03:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026480 states. [2019-09-10 09:03:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026480 states to 1026480 states and 1695007 transitions. [2019-09-10 09:03:40,711 INFO L78 Accepts]: Start accepts. Automaton has 1026480 states and 1695007 transitions. Word has length 377 [2019-09-10 09:03:40,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:40,711 INFO L475 AbstractCegarLoop]: Abstraction has 1026480 states and 1695007 transitions. [2019-09-10 09:03:40,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 09:03:40,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1026480 states and 1695007 transitions. [2019-09-10 09:03:40,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-10 09:03:40,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:03:40,838 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash -496644165, now seen corresponding path program 1 times [2019-09-10 09:03:40,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:40,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:40,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:40,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:40,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:51,434 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-10 09:03:51,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:51,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:03:51,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:51,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:03:51,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:03:51,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:03:51,438 INFO L87 Difference]: Start difference. First operand 1026480 states and 1695007 transitions. Second operand 5 states. [2019-09-10 09:04:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:14,056 INFO L93 Difference]: Finished difference Result 3029098 states and 4984652 transitions. [2019-09-10 09:04:14,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:04:14,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 377 [2019-09-10 09:04:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:21,218 INFO L225 Difference]: With dead ends: 3029098 [2019-09-10 09:04:21,218 INFO L226 Difference]: Without dead ends: 3029098 [2019-09-10 09:04:21,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:04:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029098 states.