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_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:18:25,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:18:25,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:18:25,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:18:25,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:18:25,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:18:25,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:18:25,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:18:25,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:18:25,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:18:25,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:18:25,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:18:25,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:18:25,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:18:25,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:18:25,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:18:25,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:18:25,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:18:25,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:18:25,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:18:25,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:18:25,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:18:25,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:18:25,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:18:25,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:18:25,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:18:25,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:18:25,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:18:25,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:18:25,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:18:25,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:18:25,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:18:25,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:18:25,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:18:25,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:18:25,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:18:25,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:18:25,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:18:25,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:18:25,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:18:25,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:18:25,213 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 06:18:25,227 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:18:25,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:18:25,228 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:18:25,228 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:18:25,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:18:25,229 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:18:25,230 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:18:25,230 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:18:25,230 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:18:25,230 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:18:25,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:18:25,231 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:18:25,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:18:25,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:18:25,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:18:25,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:18:25,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:18:25,233 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:18:25,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:18:25,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:18:25,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:18:25,233 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:18:25,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:18:25,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:18:25,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:18:25,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:18:25,237 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:18:25,237 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:18:25,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:18:25,238 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:18:25,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:18:25,297 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:18:25,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:18:25,302 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:18:25,302 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:18:25,303 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:18:25,373 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0c3ac454/f09d29bad3c84284a8e470045e9fb2a5/FLAGed127c4e5 [2019-09-10 06:18:25,906 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:18:25,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:18:25,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0c3ac454/f09d29bad3c84284a8e470045e9fb2a5/FLAGed127c4e5 [2019-09-10 06:18:26,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0c3ac454/f09d29bad3c84284a8e470045e9fb2a5 [2019-09-10 06:18:26,184 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:18:26,185 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:18:26,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:18:26,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:18:26,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:18:26,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:18:26" (1/1) ... [2019-09-10 06:18:26,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f76fa0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:26, skipping insertion in model container [2019-09-10 06:18:26,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:18:26" (1/1) ... [2019-09-10 06:18:26,202 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:18:26,270 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:18:26,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:18:26,778 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:18:26,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:18:26,939 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:18:26,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:26 WrapperNode [2019-09-10 06:18:26,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:18:26,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:18:26,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:18:26,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:18:26,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:26" (1/1) ... [2019-09-10 06:18:26,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:26" (1/1) ... [2019-09-10 06:18:26,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:26" (1/1) ... [2019-09-10 06:18:26,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:26" (1/1) ... [2019-09-10 06:18:27,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:26" (1/1) ... [2019-09-10 06:18:27,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:26" (1/1) ... [2019-09-10 06:18:27,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:26" (1/1) ... [2019-09-10 06:18:27,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:18:27,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:18:27,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:18:27,044 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:18:27,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:26" (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 06:18:27,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:18:27,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:18:27,126 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:18:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:18:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:18:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:18:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:18:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:18:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:18:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:18:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:18:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:18:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:18:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:18:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:18:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:18:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:18:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:18:27,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:18:27,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:18:28,661 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:18:28,661 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:18:28,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:18:28 BoogieIcfgContainer [2019-09-10 06:18:28,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:18:28,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:18:28,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:18:28,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:18:28,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:18:26" (1/3) ... [2019-09-10 06:18:28,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1179b8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:18:28, skipping insertion in model container [2019-09-10 06:18:28,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:26" (2/3) ... [2019-09-10 06:18:28,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1179b8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:18:28, skipping insertion in model container [2019-09-10 06:18:28,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:18:28" (3/3) ... [2019-09-10 06:18:28,673 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:18:28,684 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:18:28,698 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:18:28,718 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:18:28,751 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:18:28,751 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:18:28,751 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:18:28,751 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:18:28,752 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:18:28,752 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:18:28,752 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:18:28,753 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:18:28,789 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states. [2019-09-10 06:18:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:18:28,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:28,836 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] [2019-09-10 06:18:28,838 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:28,845 INFO L82 PathProgramCache]: Analyzing trace with hash 175889663, now seen corresponding path program 1 times [2019-09-10 06:18:28,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:28,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:28,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:28,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:28,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:29,523 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 06:18:29,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:29,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:29,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:29,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:29,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:29,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:29,552 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 3 states. [2019-09-10 06:18:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:29,714 INFO L93 Difference]: Finished difference Result 458 states and 789 transitions. [2019-09-10 06:18:29,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:29,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 06:18:29,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:29,735 INFO L225 Difference]: With dead ends: 458 [2019-09-10 06:18:29,736 INFO L226 Difference]: Without dead ends: 450 [2019-09-10 06:18:29,738 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 06:18:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-10 06:18:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2019-09-10 06:18:29,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-10 06:18:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 738 transitions. [2019-09-10 06:18:29,819 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 738 transitions. Word has length 114 [2019-09-10 06:18:29,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:29,820 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 738 transitions. [2019-09-10 06:18:29,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:29,820 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 738 transitions. [2019-09-10 06:18:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:18:29,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:29,823 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] [2019-09-10 06:18:29,824 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:29,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:29,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1851484959, now seen corresponding path program 1 times [2019-09-10 06:18:29,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:29,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:29,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:29,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:29,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:30,093 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 06:18:30,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:30,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:30,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:30,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:30,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:30,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:30,097 INFO L87 Difference]: Start difference. First operand 447 states and 738 transitions. Second operand 3 states. [2019-09-10 06:18:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:30,144 INFO L93 Difference]: Finished difference Result 683 states and 1125 transitions. [2019-09-10 06:18:30,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:30,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 06:18:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:30,152 INFO L225 Difference]: With dead ends: 683 [2019-09-10 06:18:30,154 INFO L226 Difference]: Without dead ends: 683 [2019-09-10 06:18:30,155 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 06:18:30,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-10 06:18:30,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 679. [2019-09-10 06:18:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-09-10 06:18:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1122 transitions. [2019-09-10 06:18:30,208 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1122 transitions. Word has length 117 [2019-09-10 06:18:30,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:30,210 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 1122 transitions. [2019-09-10 06:18:30,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1122 transitions. [2019-09-10 06:18:30,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 06:18:30,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:30,215 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] [2019-09-10 06:18:30,215 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:30,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:30,215 INFO L82 PathProgramCache]: Analyzing trace with hash 278942115, now seen corresponding path program 1 times [2019-09-10 06:18:30,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:30,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:30,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:30,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:30,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:30,398 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 06:18:30,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:30,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:30,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:30,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:30,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:30,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:30,402 INFO L87 Difference]: Start difference. First operand 679 states and 1122 transitions. Second operand 3 states. [2019-09-10 06:18:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:30,445 INFO L93 Difference]: Finished difference Result 1129 states and 1855 transitions. [2019-09-10 06:18:30,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:30,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 06:18:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:30,456 INFO L225 Difference]: With dead ends: 1129 [2019-09-10 06:18:30,456 INFO L226 Difference]: Without dead ends: 1129 [2019-09-10 06:18:30,457 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 06:18:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-10 06:18:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1123. [2019-09-10 06:18:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-09-10 06:18:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1850 transitions. [2019-09-10 06:18:30,491 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1850 transitions. Word has length 120 [2019-09-10 06:18:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:30,493 INFO L475 AbstractCegarLoop]: Abstraction has 1123 states and 1850 transitions. [2019-09-10 06:18:30,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1850 transitions. [2019-09-10 06:18:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 06:18:30,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:30,497 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] [2019-09-10 06:18:30,497 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:30,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:30,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1985226691, now seen corresponding path program 1 times [2019-09-10 06:18:30,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:30,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:30,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:30,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:30,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:30,653 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 06:18:30,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:30,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:30,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:30,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:30,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:30,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:30,656 INFO L87 Difference]: Start difference. First operand 1123 states and 1850 transitions. Second operand 3 states. [2019-09-10 06:18:30,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:30,737 INFO L93 Difference]: Finished difference Result 1981 states and 3235 transitions. [2019-09-10 06:18:30,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:30,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-10 06:18:30,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:30,751 INFO L225 Difference]: With dead ends: 1981 [2019-09-10 06:18:30,751 INFO L226 Difference]: Without dead ends: 1981 [2019-09-10 06:18:30,752 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 06:18:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-09-10 06:18:30,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1971. [2019-09-10 06:18:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-09-10 06:18:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 3226 transitions. [2019-09-10 06:18:30,803 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 3226 transitions. Word has length 123 [2019-09-10 06:18:30,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:30,804 INFO L475 AbstractCegarLoop]: Abstraction has 1971 states and 3226 transitions. [2019-09-10 06:18:30,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:30,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 3226 transitions. [2019-09-10 06:18:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 06:18:30,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:30,809 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] [2019-09-10 06:18:30,809 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:30,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:30,810 INFO L82 PathProgramCache]: Analyzing trace with hash 664168007, now seen corresponding path program 1 times [2019-09-10 06:18:30,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:30,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:30,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:30,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:30,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:30,959 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 06:18:30,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:30,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:18:30,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:30,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:18:30,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:18:30,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:18:30,961 INFO L87 Difference]: Start difference. First operand 1971 states and 3226 transitions. Second operand 6 states. [2019-09-10 06:18:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:31,395 INFO L93 Difference]: Finished difference Result 8449 states and 13925 transitions. [2019-09-10 06:18:31,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:18:31,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-10 06:18:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:31,440 INFO L225 Difference]: With dead ends: 8449 [2019-09-10 06:18:31,440 INFO L226 Difference]: Without dead ends: 8449 [2019-09-10 06:18:31,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:18:31,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8449 states. [2019-09-10 06:18:31,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8449 to 3629. [2019-09-10 06:18:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3629 states. [2019-09-10 06:18:31,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 5941 transitions. [2019-09-10 06:18:31,613 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 5941 transitions. Word has length 126 [2019-09-10 06:18:31,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:31,614 INFO L475 AbstractCegarLoop]: Abstraction has 3629 states and 5941 transitions. [2019-09-10 06:18:31,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:18:31,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 5941 transitions. [2019-09-10 06:18:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 06:18:31,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:31,617 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] [2019-09-10 06:18:31,618 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:31,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:31,618 INFO L82 PathProgramCache]: Analyzing trace with hash -951796549, now seen corresponding path program 1 times [2019-09-10 06:18:31,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:31,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:31,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:31,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:31,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:31,823 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 06:18:31,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:31,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:31,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:31,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:31,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:31,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:31,825 INFO L87 Difference]: Start difference. First operand 3629 states and 5941 transitions. Second operand 4 states. [2019-09-10 06:18:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:32,003 INFO L93 Difference]: Finished difference Result 7275 states and 11987 transitions. [2019-09-10 06:18:32,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:32,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-10 06:18:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:32,050 INFO L225 Difference]: With dead ends: 7275 [2019-09-10 06:18:32,050 INFO L226 Difference]: Without dead ends: 7275 [2019-09-10 06:18:32,051 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 06:18:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7275 states. [2019-09-10 06:18:32,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 5384. [2019-09-10 06:18:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2019-09-10 06:18:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 8835 transitions. [2019-09-10 06:18:32,248 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 8835 transitions. Word has length 127 [2019-09-10 06:18:32,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:32,249 INFO L475 AbstractCegarLoop]: Abstraction has 5384 states and 8835 transitions. [2019-09-10 06:18:32,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 8835 transitions. [2019-09-10 06:18:32,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 06:18:32,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:32,260 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] [2019-09-10 06:18:32,260 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:32,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:32,271 INFO L82 PathProgramCache]: Analyzing trace with hash 497467790, now seen corresponding path program 1 times [2019-09-10 06:18:32,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:32,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:32,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:32,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:32,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:32,402 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 06:18:32,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:32,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:32,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:32,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:32,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:32,405 INFO L87 Difference]: Start difference. First operand 5384 states and 8835 transitions. Second operand 4 states. [2019-09-10 06:18:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:32,605 INFO L93 Difference]: Finished difference Result 10590 states and 17419 transitions. [2019-09-10 06:18:32,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:32,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-10 06:18:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:32,649 INFO L225 Difference]: With dead ends: 10590 [2019-09-10 06:18:32,649 INFO L226 Difference]: Without dead ends: 10590 [2019-09-10 06:18:32,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 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 06:18:32,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10590 states. [2019-09-10 06:18:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10590 to 7963. [2019-09-10 06:18:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7963 states. [2019-09-10 06:18:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7963 states to 7963 states and 13060 transitions. [2019-09-10 06:18:32,909 INFO L78 Accepts]: Start accepts. Automaton has 7963 states and 13060 transitions. Word has length 128 [2019-09-10 06:18:32,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:32,910 INFO L475 AbstractCegarLoop]: Abstraction has 7963 states and 13060 transitions. [2019-09-10 06:18:32,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:32,910 INFO L276 IsEmpty]: Start isEmpty. Operand 7963 states and 13060 transitions. [2019-09-10 06:18:32,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:18:32,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:32,917 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] [2019-09-10 06:18:32,918 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:32,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:32,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1437707567, now seen corresponding path program 1 times [2019-09-10 06:18:32,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:32,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:32,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:32,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:32,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:33,043 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 06:18:33,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:33,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:33,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:33,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:33,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:33,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:33,046 INFO L87 Difference]: Start difference. First operand 7963 states and 13060 transitions. Second operand 3 states. [2019-09-10 06:18:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:33,165 INFO L93 Difference]: Finished difference Result 12121 states and 19845 transitions. [2019-09-10 06:18:33,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:33,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 06:18:33,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:33,200 INFO L225 Difference]: With dead ends: 12121 [2019-09-10 06:18:33,201 INFO L226 Difference]: Without dead ends: 12121 [2019-09-10 06:18:33,201 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 06:18:33,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12121 states. [2019-09-10 06:18:33,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12121 to 12119. [2019-09-10 06:18:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12119 states. [2019-09-10 06:18:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12119 states to 12119 states and 19844 transitions. [2019-09-10 06:18:33,514 INFO L78 Accepts]: Start accepts. Automaton has 12119 states and 19844 transitions. Word has length 129 [2019-09-10 06:18:33,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:33,515 INFO L475 AbstractCegarLoop]: Abstraction has 12119 states and 19844 transitions. [2019-09-10 06:18:33,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 12119 states and 19844 transitions. [2019-09-10 06:18:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:18:33,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:33,519 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] [2019-09-10 06:18:33,519 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:33,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:33,519 INFO L82 PathProgramCache]: Analyzing trace with hash -686882823, now seen corresponding path program 1 times [2019-09-10 06:18:33,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:33,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:33,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:33,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:33,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:33,615 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 06:18:33,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:33,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:33,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:33,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:33,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:33,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:33,617 INFO L87 Difference]: Start difference. First operand 12119 states and 19844 transitions. Second operand 3 states. [2019-09-10 06:18:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:33,717 INFO L93 Difference]: Finished difference Result 17029 states and 27841 transitions. [2019-09-10 06:18:33,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:33,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 06:18:33,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:33,757 INFO L225 Difference]: With dead ends: 17029 [2019-09-10 06:18:33,757 INFO L226 Difference]: Without dead ends: 17029 [2019-09-10 06:18:33,757 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 06:18:33,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17029 states. [2019-09-10 06:18:33,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17029 to 17027. [2019-09-10 06:18:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17027 states. [2019-09-10 06:18:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17027 states to 17027 states and 27840 transitions. [2019-09-10 06:18:34,040 INFO L78 Accepts]: Start accepts. Automaton has 17027 states and 27840 transitions. Word has length 129 [2019-09-10 06:18:34,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:34,041 INFO L475 AbstractCegarLoop]: Abstraction has 17027 states and 27840 transitions. [2019-09-10 06:18:34,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 17027 states and 27840 transitions. [2019-09-10 06:18:34,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:18:34,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:34,043 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] [2019-09-10 06:18:34,044 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:34,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:34,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1815419934, now seen corresponding path program 1 times [2019-09-10 06:18:34,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:34,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:34,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:34,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:34,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:34,674 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 06:18:34,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:34,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:34,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:34,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:34,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:34,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:34,676 INFO L87 Difference]: Start difference. First operand 17027 states and 27840 transitions. Second operand 4 states. [2019-09-10 06:18:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:34,896 INFO L93 Difference]: Finished difference Result 37659 states and 61652 transitions. [2019-09-10 06:18:34,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:34,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-10 06:18:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:34,981 INFO L225 Difference]: With dead ends: 37659 [2019-09-10 06:18:34,982 INFO L226 Difference]: Without dead ends: 37659 [2019-09-10 06:18:34,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 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 06:18:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37659 states. [2019-09-10 06:18:35,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37659 to 27287. [2019-09-10 06:18:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27287 states. [2019-09-10 06:18:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27287 states to 27287 states and 44556 transitions. [2019-09-10 06:18:35,657 INFO L78 Accepts]: Start accepts. Automaton has 27287 states and 44556 transitions. Word has length 129 [2019-09-10 06:18:35,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:35,657 INFO L475 AbstractCegarLoop]: Abstraction has 27287 states and 44556 transitions. [2019-09-10 06:18:35,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 27287 states and 44556 transitions. [2019-09-10 06:18:35,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:18:35,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:35,660 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] [2019-09-10 06:18:35,660 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:35,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:35,661 INFO L82 PathProgramCache]: Analyzing trace with hash -332561375, now seen corresponding path program 1 times [2019-09-10 06:18:35,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:35,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:35,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:35,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:35,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:35,759 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 06:18:35,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:35,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:35,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:35,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:35,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:35,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:35,761 INFO L87 Difference]: Start difference. First operand 27287 states and 44556 transitions. Second operand 3 states. [2019-09-10 06:18:35,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:35,890 INFO L93 Difference]: Finished difference Result 38191 states and 62255 transitions. [2019-09-10 06:18:35,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:35,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 06:18:35,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:35,976 INFO L225 Difference]: With dead ends: 38191 [2019-09-10 06:18:35,976 INFO L226 Difference]: Without dead ends: 38191 [2019-09-10 06:18:35,976 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 06:18:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38191 states. [2019-09-10 06:18:36,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38191 to 38189. [2019-09-10 06:18:36,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38189 states. [2019-09-10 06:18:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38189 states to 38189 states and 62254 transitions. [2019-09-10 06:18:36,683 INFO L78 Accepts]: Start accepts. Automaton has 38189 states and 62254 transitions. Word has length 129 [2019-09-10 06:18:36,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:36,684 INFO L475 AbstractCegarLoop]: Abstraction has 38189 states and 62254 transitions. [2019-09-10 06:18:36,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:36,684 INFO L276 IsEmpty]: Start isEmpty. Operand 38189 states and 62254 transitions. [2019-09-10 06:18:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:18:36,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:36,686 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] [2019-09-10 06:18:36,687 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:36,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:36,687 INFO L82 PathProgramCache]: Analyzing trace with hash -390628183, now seen corresponding path program 1 times [2019-09-10 06:18:36,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:36,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:36,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:36,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:36,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:36,777 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 06:18:36,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:36,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:36,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:36,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:36,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:36,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:36,779 INFO L87 Difference]: Start difference. First operand 38189 states and 62254 transitions. Second operand 3 states. [2019-09-10 06:18:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:36,958 INFO L93 Difference]: Finished difference Result 56815 states and 92723 transitions. [2019-09-10 06:18:36,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:36,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 06:18:36,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:37,101 INFO L225 Difference]: With dead ends: 56815 [2019-09-10 06:18:37,102 INFO L226 Difference]: Without dead ends: 56815 [2019-09-10 06:18:37,102 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 06:18:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56815 states. [2019-09-10 06:18:38,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56815 to 56813. [2019-09-10 06:18:38,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56813 states. [2019-09-10 06:18:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56813 states to 56813 states and 92722 transitions. [2019-09-10 06:18:38,768 INFO L78 Accepts]: Start accepts. Automaton has 56813 states and 92722 transitions. Word has length 129 [2019-09-10 06:18:38,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:38,769 INFO L475 AbstractCegarLoop]: Abstraction has 56813 states and 92722 transitions. [2019-09-10 06:18:38,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 56813 states and 92722 transitions. [2019-09-10 06:18:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 06:18:38,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:38,771 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] [2019-09-10 06:18:38,771 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:38,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:38,772 INFO L82 PathProgramCache]: Analyzing trace with hash -495937323, now seen corresponding path program 1 times [2019-09-10 06:18:38,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:38,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:38,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:38,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:38,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:38,884 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 06:18:38,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:38,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:38,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:38,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:38,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:38,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:38,886 INFO L87 Difference]: Start difference. First operand 56813 states and 92722 transitions. Second operand 4 states. [2019-09-10 06:18:39,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:39,375 INFO L93 Difference]: Finished difference Result 125501 states and 204991 transitions. [2019-09-10 06:18:39,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:39,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-10 06:18:39,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:39,647 INFO L225 Difference]: With dead ends: 125501 [2019-09-10 06:18:39,648 INFO L226 Difference]: Without dead ends: 125501 [2019-09-10 06:18:39,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 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 06:18:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125501 states. [2019-09-10 06:18:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125501 to 90932. [2019-09-10 06:18:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90932 states. [2019-09-10 06:18:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90932 states to 90932 states and 148075 transitions. [2019-09-10 06:18:43,160 INFO L78 Accepts]: Start accepts. Automaton has 90932 states and 148075 transitions. Word has length 130 [2019-09-10 06:18:43,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:43,161 INFO L475 AbstractCegarLoop]: Abstraction has 90932 states and 148075 transitions. [2019-09-10 06:18:43,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 90932 states and 148075 transitions. [2019-09-10 06:18:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 06:18:43,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:43,165 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] [2019-09-10 06:18:43,165 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:43,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:43,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1344026747, now seen corresponding path program 1 times [2019-09-10 06:18:43,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:43,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:43,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:43,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:43,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:43,504 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 06:18:43,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:43,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:18:43,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:43,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:18:43,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:18:43,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:18:43,506 INFO L87 Difference]: Start difference. First operand 90932 states and 148075 transitions. Second operand 6 states. [2019-09-10 06:18:43,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:43,931 INFO L93 Difference]: Finished difference Result 90934 states and 147451 transitions. [2019-09-10 06:18:43,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:18:43,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-10 06:18:43,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:44,088 INFO L225 Difference]: With dead ends: 90934 [2019-09-10 06:18:44,089 INFO L226 Difference]: Without dead ends: 90934 [2019-09-10 06:18:44,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:18:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90934 states. [2019-09-10 06:18:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90934 to 90932. [2019-09-10 06:18:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90932 states. [2019-09-10 06:18:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90932 states to 90932 states and 147450 transitions. [2019-09-10 06:18:45,681 INFO L78 Accepts]: Start accepts. Automaton has 90932 states and 147450 transitions. Word has length 132 [2019-09-10 06:18:45,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:45,681 INFO L475 AbstractCegarLoop]: Abstraction has 90932 states and 147450 transitions. [2019-09-10 06:18:45,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:18:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 90932 states and 147450 transitions. [2019-09-10 06:18:45,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 06:18:45,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:45,683 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] [2019-09-10 06:18:45,683 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:45,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:45,684 INFO L82 PathProgramCache]: Analyzing trace with hash 29972819, now seen corresponding path program 1 times [2019-09-10 06:18:45,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:45,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:45,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:45,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:45,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:45,935 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 06:18:45,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:45,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:18:45,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:45,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:18:45,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:18:45,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:18:45,937 INFO L87 Difference]: Start difference. First operand 90932 states and 147450 transitions. Second operand 6 states. [2019-09-10 06:18:48,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:48,746 INFO L93 Difference]: Finished difference Result 205462 states and 332581 transitions. [2019-09-10 06:18:48,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:18:48,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-09-10 06:18:48,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:48,996 INFO L225 Difference]: With dead ends: 205462 [2019-09-10 06:18:48,996 INFO L226 Difference]: Without dead ends: 205462 [2019-09-10 06:18:48,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:18:49,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205462 states. [2019-09-10 06:18:50,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205462 to 205458. [2019-09-10 06:18:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205458 states. [2019-09-10 06:18:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205458 states to 205458 states and 332579 transitions. [2019-09-10 06:18:51,502 INFO L78 Accepts]: Start accepts. Automaton has 205458 states and 332579 transitions. Word has length 135 [2019-09-10 06:18:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:51,503 INFO L475 AbstractCegarLoop]: Abstraction has 205458 states and 332579 transitions. [2019-09-10 06:18:51,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:18:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 205458 states and 332579 transitions. [2019-09-10 06:18:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 06:18:51,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:51,504 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] [2019-09-10 06:18:51,505 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:51,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:51,505 INFO L82 PathProgramCache]: Analyzing trace with hash 927248290, now seen corresponding path program 1 times [2019-09-10 06:18:51,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:51,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:51,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:51,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:51,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:51,649 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 06:18:51,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:51,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:18:51,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:51,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:18:51,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:18:51,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:18:51,651 INFO L87 Difference]: Start difference. First operand 205458 states and 332579 transitions. Second operand 5 states. [2019-09-10 06:18:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:52,500 INFO L93 Difference]: Finished difference Result 394478 states and 634162 transitions. [2019-09-10 06:18:52,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:18:52,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-09-10 06:18:52,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:53,076 INFO L225 Difference]: With dead ends: 394478 [2019-09-10 06:18:53,076 INFO L226 Difference]: Without dead ends: 394478 [2019-09-10 06:18:53,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:18:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394478 states. [2019-09-10 06:18:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394478 to 210114. [2019-09-10 06:18:59,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210114 states. [2019-09-10 06:19:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210114 states to 210114 states and 337208 transitions. [2019-09-10 06:19:00,755 INFO L78 Accepts]: Start accepts. Automaton has 210114 states and 337208 transitions. Word has length 136 [2019-09-10 06:19:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:00,756 INFO L475 AbstractCegarLoop]: Abstraction has 210114 states and 337208 transitions. [2019-09-10 06:19:00,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:19:00,756 INFO L276 IsEmpty]: Start isEmpty. Operand 210114 states and 337208 transitions. [2019-09-10 06:19:00,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:19:00,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:00,764 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:00,764 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:00,765 INFO L82 PathProgramCache]: Analyzing trace with hash 179427060, now seen corresponding path program 1 times [2019-09-10 06:19:00,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:00,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:00,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:00,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:00,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:19:00,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:00,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:19:00,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:00,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:19:00,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:19:00,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:19:00,948 INFO L87 Difference]: Start difference. First operand 210114 states and 337208 transitions. Second operand 6 states. [2019-09-10 06:19:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:01,973 INFO L93 Difference]: Finished difference Result 373577 states and 599998 transitions. [2019-09-10 06:19:01,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:19:01,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:19:01,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:02,501 INFO L225 Difference]: With dead ends: 373577 [2019-09-10 06:19:02,502 INFO L226 Difference]: Without dead ends: 373577 [2019-09-10 06:19:02,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:19:02,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373577 states. [2019-09-10 06:19:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373577 to 291115. [2019-09-10 06:19:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291115 states. [2019-09-10 06:19:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291115 states to 291115 states and 466642 transitions. [2019-09-10 06:19:10,026 INFO L78 Accepts]: Start accepts. Automaton has 291115 states and 466642 transitions. Word has length 167 [2019-09-10 06:19:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:10,027 INFO L475 AbstractCegarLoop]: Abstraction has 291115 states and 466642 transitions. [2019-09-10 06:19:10,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:19:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 291115 states and 466642 transitions. [2019-09-10 06:19:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:19:10,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:10,036 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:10,036 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:10,037 INFO L82 PathProgramCache]: Analyzing trace with hash 930251804, now seen corresponding path program 1 times [2019-09-10 06:19:10,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:10,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:10,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:10,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:10,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:19:10,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:10,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:19:10,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:10,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:19:10,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:19:10,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:19:10,233 INFO L87 Difference]: Start difference. First operand 291115 states and 466642 transitions. Second operand 6 states. [2019-09-10 06:19:15,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:15,501 INFO L93 Difference]: Finished difference Result 413673 states and 664622 transitions. [2019-09-10 06:19:15,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:19:15,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:19:15,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:16,156 INFO L225 Difference]: With dead ends: 413673 [2019-09-10 06:19:16,156 INFO L226 Difference]: Without dead ends: 413673 [2019-09-10 06:19:16,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:19:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413673 states. [2019-09-10 06:19:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413673 to 368773. [2019-09-10 06:19:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368773 states. [2019-09-10 06:19:20,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368773 states to 368773 states and 591198 transitions. [2019-09-10 06:19:20,474 INFO L78 Accepts]: Start accepts. Automaton has 368773 states and 591198 transitions. Word has length 167 [2019-09-10 06:19:20,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:20,475 INFO L475 AbstractCegarLoop]: Abstraction has 368773 states and 591198 transitions. [2019-09-10 06:19:20,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:19:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand 368773 states and 591198 transitions. [2019-09-10 06:19:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:19:20,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:20,482 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:20,483 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:20,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:20,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1284573252, now seen corresponding path program 1 times [2019-09-10 06:19:20,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:20,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:20,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:20,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:20,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 06:19:20,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:20,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:19:20,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:20,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:19:20,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:19:20,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:19:20,662 INFO L87 Difference]: Start difference. First operand 368773 states and 591198 transitions. Second operand 6 states. [2019-09-10 06:19:27,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:27,825 INFO L93 Difference]: Finished difference Result 438685 states and 704878 transitions. [2019-09-10 06:19:27,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:19:27,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:19:27,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:28,420 INFO L225 Difference]: With dead ends: 438685 [2019-09-10 06:19:28,420 INFO L226 Difference]: Without dead ends: 438685 [2019-09-10 06:19:28,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:19:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438685 states. [2019-09-10 06:19:32,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438685 to 414701. [2019-09-10 06:19:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414701 states. [2019-09-10 06:19:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414701 states to 414701 states and 665314 transitions. [2019-09-10 06:19:32,738 INFO L78 Accepts]: Start accepts. Automaton has 414701 states and 665314 transitions. Word has length 167 [2019-09-10 06:19:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:32,738 INFO L475 AbstractCegarLoop]: Abstraction has 414701 states and 665314 transitions. [2019-09-10 06:19:32,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:19:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 414701 states and 665314 transitions. [2019-09-10 06:19:32,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:19:32,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:32,745 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:32,745 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:32,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:32,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1226506444, now seen corresponding path program 1 times [2019-09-10 06:19:32,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:32,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:32,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:32,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:32,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:19:32,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:32,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:19:32,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:32,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:19:32,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:19:32,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:19:32,950 INFO L87 Difference]: Start difference. First operand 414701 states and 665314 transitions. Second operand 6 states. [2019-09-10 06:19:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:35,559 INFO L93 Difference]: Finished difference Result 564669 states and 909650 transitions. [2019-09-10 06:19:35,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:19:35,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:19:35,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:36,325 INFO L225 Difference]: With dead ends: 564669 [2019-09-10 06:19:36,325 INFO L226 Difference]: Without dead ends: 564669 [2019-09-10 06:19:36,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:19:43,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564669 states. [2019-09-10 06:19:48,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564669 to 508157. [2019-09-10 06:19:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508157 states. [2019-09-10 06:19:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508157 states to 508157 states and 816726 transitions. [2019-09-10 06:19:49,985 INFO L78 Accepts]: Start accepts. Automaton has 508157 states and 816726 transitions. Word has length 167 [2019-09-10 06:19:49,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:49,985 INFO L475 AbstractCegarLoop]: Abstraction has 508157 states and 816726 transitions. [2019-09-10 06:19:49,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:19:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 508157 states and 816726 transitions. [2019-09-10 06:19:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 06:19:49,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:49,990 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:49,990 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:49,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:49,991 INFO L82 PathProgramCache]: Analyzing trace with hash 498916304, now seen corresponding path program 1 times [2019-09-10 06:19:49,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:49,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:49,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:49,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:49,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:19:50,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:50,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:50,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:50,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:50,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:50,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:50,100 INFO L87 Difference]: Start difference. First operand 508157 states and 816726 transitions. Second operand 3 states. [2019-09-10 06:19:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:59,275 INFO L93 Difference]: Finished difference Result 870701 states and 1400142 transitions. [2019-09-10 06:19:59,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:59,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 06:19:59,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:00,483 INFO L225 Difference]: With dead ends: 870701 [2019-09-10 06:20:00,483 INFO L226 Difference]: Without dead ends: 870701 [2019-09-10 06:20:00,483 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 06:20:01,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870701 states. [2019-09-10 06:20:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870701 to 869234. [2019-09-10 06:20:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869234 states. [2019-09-10 06:20:25,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869234 states to 869234 states and 1398676 transitions. [2019-09-10 06:20:25,288 INFO L78 Accepts]: Start accepts. Automaton has 869234 states and 1398676 transitions. Word has length 168 [2019-09-10 06:20:25,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:25,289 INFO L475 AbstractCegarLoop]: Abstraction has 869234 states and 1398676 transitions. [2019-09-10 06:20:25,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:20:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 869234 states and 1398676 transitions. [2019-09-10 06:20:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 06:20:25,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:25,297 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:20:25,297 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:25,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:25,298 INFO L82 PathProgramCache]: Analyzing trace with hash -699174186, now seen corresponding path program 1 times [2019-09-10 06:20:25,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:25,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:25,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:25,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:25,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:34,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:20:34,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:20:34,150 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 169 with the following transitions: [2019-09-10 06:20:34,152 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [216], [219], [222], [225], [228], [231], [234], [237], [240], [243], [246], [249], [253], [258], [282], [285], [287], [403], [406], [409], [412], [415], [418], [425], [433], [435], [438], [439], [441], [450], [453], [464], [467], [477], [499], [502], [539], [547], [555], [563], [585], [588], [625], [633], [641], [649], [671], [674], [711], [719], [727], [735], [745], [749], [753], [755], [757], [760], [797], [805], [813], [821], [1445], [1446], [1450], [1451], [1452] [2019-09-10 06:20:34,226 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:20:34,226 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:20:34,487 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:20:34,941 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:20:34,944 INFO L272 AbstractInterpreter]: Visited 146 different actions 259 times. Merged at 47 different actions 108 times. Never widened. Performed 1024 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1024 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 278 variables. [2019-09-10 06:20:34,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:34,951 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:20:35,894 INFO L227 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 89.09% of their original sizes. [2019-09-10 06:20:35,894 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:21:01,320 INFO L420 sIntCurrentIteration]: We unified 167 AI predicates to 167 [2019-09-10 06:21:01,320 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:21:01,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:21:01,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [100] imperfect sequences [10] total 108 [2019-09-10 06:21:01,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:01,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-10 06:21:01,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-10 06:21:01,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1611, Invalid=8289, Unknown=0, NotChecked=0, Total=9900 [2019-09-10 06:21:01,326 INFO L87 Difference]: Start difference. First operand 869234 states and 1398676 transitions. Second operand 100 states.