java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:23:22,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:22,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:22,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:22,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:22,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:22,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:22,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:22,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:22,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:22,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:22,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:22,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:22,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:22,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:22,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:22,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:22,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:22,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:22,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:22,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:22,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:22,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:22,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:22,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:22,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:22,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:22,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:22,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:22,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:22,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:22,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:22,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:22,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:22,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:22,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:22,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:22,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:22,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:23,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:23,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:23,005 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:23:23,025 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:23,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:23,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:23,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:23,027 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:23,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:23,028 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:23,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:23,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:23,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:23,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:23,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:23,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:23,029 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:23,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:23,030 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:23,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:23,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:23,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:23,031 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:23,031 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:23,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:23,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:23,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:23,032 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:23,032 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:23,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:23,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:23,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:23:23,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:23,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:23,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:23,385 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:23,385 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:23,386 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 01:23:23,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3569019/db39731b05fe45f2b9769a3c9eba3788/FLAGc52556c83 [2019-10-15 01:23:24,210 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:24,211 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 01:23:24,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3569019/db39731b05fe45f2b9769a3c9eba3788/FLAGc52556c83 [2019-10-15 01:23:24,347 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3569019/db39731b05fe45f2b9769a3c9eba3788 [2019-10-15 01:23:24,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:24,358 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:24,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:24,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:24,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:24,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:24" (1/1) ... [2019-10-15 01:23:24,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a14aaf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:24, skipping insertion in model container [2019-10-15 01:23:24,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:24" (1/1) ... [2019-10-15 01:23:24,370 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:24,512 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:25,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:25,564 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:25,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:25,896 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:25,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:25 WrapperNode [2019-10-15 01:23:25,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:25,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:25,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:25,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:25,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:25" (1/1) ... [2019-10-15 01:23:25,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:25" (1/1) ... [2019-10-15 01:23:25,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:25" (1/1) ... [2019-10-15 01:23:25,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:25" (1/1) ... [2019-10-15 01:23:26,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:25" (1/1) ... [2019-10-15 01:23:26,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:25" (1/1) ... [2019-10-15 01:23:26,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:25" (1/1) ... [2019-10-15 01:23:26,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:26,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:26,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:26,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:26,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:26,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:26,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:26,315 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:26,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:26,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 01:23:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:26,319 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:23:26,325 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:23:26,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:26,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:30,265 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:30,265 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:30,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:30 BoogieIcfgContainer [2019-10-15 01:23:30,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:30,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:30,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:30,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:30,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:24" (1/3) ... [2019-10-15 01:23:30,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3130d728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:30, skipping insertion in model container [2019-10-15 01:23:30,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:25" (2/3) ... [2019-10-15 01:23:30,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3130d728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:30, skipping insertion in model container [2019-10-15 01:23:30,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:30" (3/3) ... [2019-10-15 01:23:30,276 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 01:23:30,287 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:30,298 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-15 01:23:30,312 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-15 01:23:30,367 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:30,367 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:30,367 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:30,367 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:30,368 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:30,368 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:30,368 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:30,368 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states. [2019-10-15 01:23:30,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:23:30,461 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:30,462 INFO L380 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] [2019-10-15 01:23:30,464 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:30,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:30,471 INFO L82 PathProgramCache]: Analyzing trace with hash -261683, now seen corresponding path program 1 times [2019-10-15 01:23:30,481 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:30,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031847691] [2019-10-15 01:23:30,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:30,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:30,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:31,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031847691] [2019-10-15 01:23:31,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:31,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:31,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085302396] [2019-10-15 01:23:31,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:31,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:31,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:31,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:31,062 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand 5 states. [2019-10-15 01:23:33,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:33,284 INFO L93 Difference]: Finished difference Result 2475 states and 4331 transitions. [2019-10-15 01:23:33,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:33,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-15 01:23:33,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:33,313 INFO L225 Difference]: With dead ends: 2475 [2019-10-15 01:23:33,313 INFO L226 Difference]: Without dead ends: 1554 [2019-10-15 01:23:33,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:33,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-10-15 01:23:33,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1548. [2019-10-15 01:23:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-10-15 01:23:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2090 transitions. [2019-10-15 01:23:33,526 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2090 transitions. Word has length 55 [2019-10-15 01:23:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:33,527 INFO L462 AbstractCegarLoop]: Abstraction has 1548 states and 2090 transitions. [2019-10-15 01:23:33,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2090 transitions. [2019-10-15 01:23:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:33,533 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:33,533 INFO L380 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] [2019-10-15 01:23:33,533 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:33,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:33,535 INFO L82 PathProgramCache]: Analyzing trace with hash -19234945, now seen corresponding path program 1 times [2019-10-15 01:23:33,535 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:33,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64622544] [2019-10-15 01:23:33,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:33,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:33,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:33,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64622544] [2019-10-15 01:23:33,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:33,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:33,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368582252] [2019-10-15 01:23:33,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:33,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:33,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:33,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:33,801 INFO L87 Difference]: Start difference. First operand 1548 states and 2090 transitions. Second operand 6 states. [2019-10-15 01:23:35,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:35,261 INFO L93 Difference]: Finished difference Result 3384 states and 4662 transitions. [2019-10-15 01:23:35,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:35,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-15 01:23:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:35,277 INFO L225 Difference]: With dead ends: 3384 [2019-10-15 01:23:35,277 INFO L226 Difference]: Without dead ends: 2296 [2019-10-15 01:23:35,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:23:35,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2019-10-15 01:23:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2280. [2019-10-15 01:23:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-10-15 01:23:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3126 transitions. [2019-10-15 01:23:35,382 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3126 transitions. Word has length 56 [2019-10-15 01:23:35,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:35,383 INFO L462 AbstractCegarLoop]: Abstraction has 2280 states and 3126 transitions. [2019-10-15 01:23:35,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3126 transitions. [2019-10-15 01:23:35,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:35,388 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:35,388 INFO L380 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] [2019-10-15 01:23:35,388 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:35,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:35,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1128300978, now seen corresponding path program 1 times [2019-10-15 01:23:35,389 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:35,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628714383] [2019-10-15 01:23:35,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:35,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:35,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:35,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628714383] [2019-10-15 01:23:35,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:35,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:35,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727299462] [2019-10-15 01:23:35,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:35,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:35,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:35,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:35,523 INFO L87 Difference]: Start difference. First operand 2280 states and 3126 transitions. Second operand 6 states. [2019-10-15 01:23:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:37,124 INFO L93 Difference]: Finished difference Result 5893 states and 8147 transitions. [2019-10-15 01:23:37,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:37,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-15 01:23:37,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:37,148 INFO L225 Difference]: With dead ends: 5893 [2019-10-15 01:23:37,148 INFO L226 Difference]: Without dead ends: 4335 [2019-10-15 01:23:37,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:23:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4335 states. [2019-10-15 01:23:37,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4335 to 4315. [2019-10-15 01:23:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-10-15 01:23:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5971 transitions. [2019-10-15 01:23:37,369 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5971 transitions. Word has length 56 [2019-10-15 01:23:37,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:37,369 INFO L462 AbstractCegarLoop]: Abstraction has 4315 states and 5971 transitions. [2019-10-15 01:23:37,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:37,370 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5971 transitions. [2019-10-15 01:23:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:23:37,375 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:37,375 INFO L380 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] [2019-10-15 01:23:37,376 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:37,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:37,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1514896090, now seen corresponding path program 1 times [2019-10-15 01:23:37,377 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:37,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537465317] [2019-10-15 01:23:37,377 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:37,378 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:37,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:37,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537465317] [2019-10-15 01:23:37,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:37,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:37,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250271696] [2019-10-15 01:23:37,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:37,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:37,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:37,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:37,682 INFO L87 Difference]: Start difference. First operand 4315 states and 5971 transitions. Second operand 9 states. [2019-10-15 01:23:38,002 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2019-10-15 01:23:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:41,668 INFO L93 Difference]: Finished difference Result 8360 states and 12149 transitions. [2019-10-15 01:23:41,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-15 01:23:41,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-15 01:23:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:41,711 INFO L225 Difference]: With dead ends: 8360 [2019-10-15 01:23:41,711 INFO L226 Difference]: Without dead ends: 8355 [2019-10-15 01:23:41,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:23:41,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8355 states. [2019-10-15 01:23:42,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8355 to 4315. [2019-10-15 01:23:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-10-15 01:23:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5970 transitions. [2019-10-15 01:23:42,053 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5970 transitions. Word has length 57 [2019-10-15 01:23:42,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:42,054 INFO L462 AbstractCegarLoop]: Abstraction has 4315 states and 5970 transitions. [2019-10-15 01:23:42,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:42,055 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5970 transitions. [2019-10-15 01:23:42,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:23:42,060 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:42,060 INFO L380 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] [2019-10-15 01:23:42,061 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:42,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:42,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1846472251, now seen corresponding path program 1 times [2019-10-15 01:23:42,062 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:42,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94544832] [2019-10-15 01:23:42,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:42,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:42,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:42,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94544832] [2019-10-15 01:23:42,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:42,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:42,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512426571] [2019-10-15 01:23:42,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:42,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:42,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:42,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:42,264 INFO L87 Difference]: Start difference. First operand 4315 states and 5970 transitions. Second operand 9 states. [2019-10-15 01:23:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:46,269 INFO L93 Difference]: Finished difference Result 12184 states and 17666 transitions. [2019-10-15 01:23:46,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 01:23:46,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-15 01:23:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:46,322 INFO L225 Difference]: With dead ends: 12184 [2019-10-15 01:23:46,322 INFO L226 Difference]: Without dead ends: 11066 [2019-10-15 01:23:46,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:23:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11066 states. [2019-10-15 01:23:46,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11066 to 4315. [2019-10-15 01:23:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-10-15 01:23:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5969 transitions. [2019-10-15 01:23:46,640 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5969 transitions. Word has length 57 [2019-10-15 01:23:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:46,641 INFO L462 AbstractCegarLoop]: Abstraction has 4315 states and 5969 transitions. [2019-10-15 01:23:46,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:46,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5969 transitions. [2019-10-15 01:23:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:23:46,648 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:46,648 INFO L380 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] [2019-10-15 01:23:46,649 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:46,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:46,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1057258768, now seen corresponding path program 1 times [2019-10-15 01:23:46,650 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:46,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941047560] [2019-10-15 01:23:46,650 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:46,650 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:46,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:46,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941047560] [2019-10-15 01:23:46,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:46,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:23:46,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261212438] [2019-10-15 01:23:46,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:23:46,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:46,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:23:46,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:23:46,856 INFO L87 Difference]: Start difference. First operand 4315 states and 5969 transitions. Second operand 8 states. [2019-10-15 01:23:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:50,071 INFO L93 Difference]: Finished difference Result 9387 states and 13823 transitions. [2019-10-15 01:23:50,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:23:50,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-10-15 01:23:50,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:50,094 INFO L225 Difference]: With dead ends: 9387 [2019-10-15 01:23:50,095 INFO L226 Difference]: Without dead ends: 8061 [2019-10-15 01:23:50,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:23:50,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8061 states. [2019-10-15 01:23:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8061 to 4315. [2019-10-15 01:23:50,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-10-15 01:23:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5968 transitions. [2019-10-15 01:23:50,415 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5968 transitions. Word has length 57 [2019-10-15 01:23:50,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:50,416 INFO L462 AbstractCegarLoop]: Abstraction has 4315 states and 5968 transitions. [2019-10-15 01:23:50,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:23:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5968 transitions. [2019-10-15 01:23:50,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:23:50,420 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:50,420 INFO L380 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] [2019-10-15 01:23:50,421 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:50,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:50,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1610727569, now seen corresponding path program 1 times [2019-10-15 01:23:50,421 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:50,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696553982] [2019-10-15 01:23:50,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:50,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:50,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:50,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696553982] [2019-10-15 01:23:50,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:50,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:50,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560580638] [2019-10-15 01:23:50,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:50,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:50,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:50,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:50,517 INFO L87 Difference]: Start difference. First operand 4315 states and 5968 transitions. Second operand 3 states. [2019-10-15 01:23:51,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:51,037 INFO L93 Difference]: Finished difference Result 7979 states and 11287 transitions. [2019-10-15 01:23:51,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:51,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 01:23:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:51,054 INFO L225 Difference]: With dead ends: 7979 [2019-10-15 01:23:51,055 INFO L226 Difference]: Without dead ends: 5459 [2019-10-15 01:23:51,064 INFO L600 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-10-15 01:23:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5459 states. [2019-10-15 01:23:51,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5459 to 5453. [2019-10-15 01:23:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-10-15 01:23:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 7525 transitions. [2019-10-15 01:23:51,441 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 7525 transitions. Word has length 58 [2019-10-15 01:23:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:51,443 INFO L462 AbstractCegarLoop]: Abstraction has 5453 states and 7525 transitions. [2019-10-15 01:23:51,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 7525 transitions. [2019-10-15 01:23:51,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:23:51,450 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:51,450 INFO L380 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] [2019-10-15 01:23:51,450 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:51,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:51,451 INFO L82 PathProgramCache]: Analyzing trace with hash 616197657, now seen corresponding path program 1 times [2019-10-15 01:23:51,451 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:51,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778464865] [2019-10-15 01:23:51,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:51,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:51,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:51,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:51,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778464865] [2019-10-15 01:23:51,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:51,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:51,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619476391] [2019-10-15 01:23:51,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:51,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:51,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:51,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:51,561 INFO L87 Difference]: Start difference. First operand 5453 states and 7525 transitions. Second operand 3 states. [2019-10-15 01:23:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:52,084 INFO L93 Difference]: Finished difference Result 8882 states and 12823 transitions. [2019-10-15 01:23:52,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:52,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 01:23:52,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:52,101 INFO L225 Difference]: With dead ends: 8882 [2019-10-15 01:23:52,102 INFO L226 Difference]: Without dead ends: 6617 [2019-10-15 01:23:52,109 INFO L600 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-10-15 01:23:52,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2019-10-15 01:23:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6025. [2019-10-15 01:23:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6025 states. [2019-10-15 01:23:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 8443 transitions. [2019-10-15 01:23:52,496 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 8443 transitions. Word has length 58 [2019-10-15 01:23:52,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:52,497 INFO L462 AbstractCegarLoop]: Abstraction has 6025 states and 8443 transitions. [2019-10-15 01:23:52,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 8443 transitions. [2019-10-15 01:23:52,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:23:52,502 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:52,502 INFO L380 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] [2019-10-15 01:23:52,502 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:52,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:52,503 INFO L82 PathProgramCache]: Analyzing trace with hash -700313303, now seen corresponding path program 1 times [2019-10-15 01:23:52,503 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:52,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133184191] [2019-10-15 01:23:52,503 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,503 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:52,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:52,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:52,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133184191] [2019-10-15 01:23:52,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:52,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:52,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130224800] [2019-10-15 01:23:52,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:52,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:52,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:52,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:52,571 INFO L87 Difference]: Start difference. First operand 6025 states and 8443 transitions. Second operand 3 states. [2019-10-15 01:23:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:53,068 INFO L93 Difference]: Finished difference Result 11249 states and 16372 transitions. [2019-10-15 01:23:53,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:53,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 01:23:53,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:53,086 INFO L225 Difference]: With dead ends: 11249 [2019-10-15 01:23:53,087 INFO L226 Difference]: Without dead ends: 8007 [2019-10-15 01:23:53,096 INFO L600 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-10-15 01:23:53,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8007 states. [2019-10-15 01:23:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8007 to 7105. [2019-10-15 01:23:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7105 states. [2019-10-15 01:23:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 10025 transitions. [2019-10-15 01:23:53,774 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 10025 transitions. Word has length 58 [2019-10-15 01:23:53,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:53,774 INFO L462 AbstractCegarLoop]: Abstraction has 7105 states and 10025 transitions. [2019-10-15 01:23:53,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 10025 transitions. [2019-10-15 01:23:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:23:53,779 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:53,779 INFO L380 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] [2019-10-15 01:23:53,779 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:53,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:53,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1592896813, now seen corresponding path program 1 times [2019-10-15 01:23:53,780 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:53,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539035065] [2019-10-15 01:23:53,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:53,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:53,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539035065] [2019-10-15 01:23:53,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:53,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:53,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781198927] [2019-10-15 01:23:53,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:53,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:53,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:53,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:53,838 INFO L87 Difference]: Start difference. First operand 7105 states and 10025 transitions. Second operand 3 states. [2019-10-15 01:23:54,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:54,910 INFO L93 Difference]: Finished difference Result 13710 states and 19567 transitions. [2019-10-15 01:23:54,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:54,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-15 01:23:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:54,930 INFO L225 Difference]: With dead ends: 13710 [2019-10-15 01:23:54,930 INFO L226 Difference]: Without dead ends: 7194 [2019-10-15 01:23:54,949 INFO L600 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-10-15 01:23:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states. [2019-10-15 01:23:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 5653. [2019-10-15 01:23:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5653 states. [2019-10-15 01:23:55,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 8055 transitions. [2019-10-15 01:23:55,405 INFO L78 Accepts]: Start accepts. Automaton has 5653 states and 8055 transitions. Word has length 59 [2019-10-15 01:23:55,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:55,405 INFO L462 AbstractCegarLoop]: Abstraction has 5653 states and 8055 transitions. [2019-10-15 01:23:55,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:55,405 INFO L276 IsEmpty]: Start isEmpty. Operand 5653 states and 8055 transitions. [2019-10-15 01:23:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:23:55,408 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:55,408 INFO L380 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] [2019-10-15 01:23:55,408 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:55,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:55,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1119557590, now seen corresponding path program 1 times [2019-10-15 01:23:55,409 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:55,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13928870] [2019-10-15 01:23:55,409 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,409 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:55,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13928870] [2019-10-15 01:23:55,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:55,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:55,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155654808] [2019-10-15 01:23:55,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:55,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:55,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:55,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:55,472 INFO L87 Difference]: Start difference. First operand 5653 states and 8055 transitions. Second operand 3 states.