java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:43:51,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:43:51,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:43:51,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:43:51,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:43:51,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:43:51,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:43:51,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:43:51,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:43:51,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:43:51,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:43:51,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:43:51,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:43:51,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:43:51,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:43:51,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:43:51,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:43:52,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:43:52,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:43:52,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:43:52,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:43:52,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:43:52,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:43:52,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:43:52,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:43:52,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:43:52,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:43:52,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:43:52,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:43:52,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:43:52,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:43:52,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:43:52,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:43:52,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:43:52,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:43:52,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:43:52,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:43:52,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:43:52,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:43:52,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:43:52,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:43:52,021 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-14 23:43:52,036 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:43:52,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:43:52,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:43:52,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:43:52,038 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:43:52,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:43:52,041 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:43:52,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:43:52,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:43:52,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:43:52,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:43:52,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:43:52,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:43:52,042 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:43:52,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:43:52,042 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:43:52,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:43:52,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:43:52,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:43:52,044 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:43:52,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:43:52,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:43:52,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:43:52,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:43:52,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:43:52,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:43:52,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:43:52,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:43:52,046 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:43:52,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:43:52,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:43:52,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:43:52,358 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:43:52,359 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:43:52,360 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-14 23:43:52,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a70b9f42/d00ff9ca4b5c4156aa7265ecf26d0e4a/FLAG65891ee33 [2019-10-14 23:43:52,992 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:43:52,993 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-14 23:43:53,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a70b9f42/d00ff9ca4b5c4156aa7265ecf26d0e4a/FLAG65891ee33 [2019-10-14 23:43:53,282 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a70b9f42/d00ff9ca4b5c4156aa7265ecf26d0e4a [2019-10-14 23:43:53,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:43:53,300 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:43:53,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:43:53,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:43:53,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:43:53,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:43:53" (1/1) ... [2019-10-14 23:43:53,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5287bcf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:53, skipping insertion in model container [2019-10-14 23:43:53,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:43:53" (1/1) ... [2019-10-14 23:43:53,317 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:43:53,379 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:43:53,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:43:53,873 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:43:54,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:43:54,062 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:43:54,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:54 WrapperNode [2019-10-14 23:43:54,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:43:54,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:43:54,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:43:54,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:43:54,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:54" (1/1) ... [2019-10-14 23:43:54,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:54" (1/1) ... [2019-10-14 23:43:54,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:54" (1/1) ... [2019-10-14 23:43:54,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:54" (1/1) ... [2019-10-14 23:43:54,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:54" (1/1) ... [2019-10-14 23:43:54,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:54" (1/1) ... [2019-10-14 23:43:54,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:54" (1/1) ... [2019-10-14 23:43:54,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:43:54,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:43:54,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:43:54,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:43:54,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:54" (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-14 23:43:54,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:43:54,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:43:54,219 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:43:54,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:43:54,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:43:54,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-14 23:43:54,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-14 23:43:54,222 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-14 23:43:54,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:43:54,222 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-14 23:43:54,222 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-14 23:43:54,223 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-14 23:43:54,223 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-14 23:43:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-14 23:43:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-14 23:43:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-14 23:43:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:43:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:43:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:43:55,510 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:43:55,511 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-14 23:43:55,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:43:55 BoogieIcfgContainer [2019-10-14 23:43:55,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:43:55,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:43:55,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:43:55,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:43:55,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:43:53" (1/3) ... [2019-10-14 23:43:55,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa707dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:43:55, skipping insertion in model container [2019-10-14 23:43:55,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:54" (2/3) ... [2019-10-14 23:43:55,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa707dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:43:55, skipping insertion in model container [2019-10-14 23:43:55,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:43:55" (3/3) ... [2019-10-14 23:43:55,521 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-14 23:43:55,532 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:43:55,541 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-14 23:43:55,553 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-14 23:43:55,582 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:43:55,582 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:43:55,583 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:43:55,583 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:43:55,584 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:43:55,584 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:43:55,585 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:43:55,585 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:43:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states. [2019-10-14 23:43:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-14 23:43:55,654 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:43:55,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:43:55,658 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:43:55,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:43:55,664 INFO L82 PathProgramCache]: Analyzing trace with hash -953301641, now seen corresponding path program 1 times [2019-10-14 23:43:55,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:43:55,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269505588] [2019-10-14 23:43:55,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:55,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:55,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:43:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:56,769 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-14 23:43:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:56,861 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-14 23:43:56,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269505588] [2019-10-14 23:43:56,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:43:56,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:43:56,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746915255] [2019-10-14 23:43:56,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:43:56,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:43:56,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:43:56,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:43:56,888 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 5 states. [2019-10-14 23:43:59,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:43:59,201 INFO L93 Difference]: Finished difference Result 716 states and 1269 transitions. [2019-10-14 23:43:59,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:43:59,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-10-14 23:43:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:43:59,221 INFO L225 Difference]: With dead ends: 716 [2019-10-14 23:43:59,221 INFO L226 Difference]: Without dead ends: 471 [2019-10-14 23:43:59,226 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:43:59,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-10-14 23:43:59,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 450. [2019-10-14 23:43:59,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-14 23:43:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 654 transitions. [2019-10-14 23:43:59,314 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 654 transitions. Word has length 96 [2019-10-14 23:43:59,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:43:59,315 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 654 transitions. [2019-10-14 23:43:59,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:43:59,315 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 654 transitions. [2019-10-14 23:43:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-14 23:43:59,320 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:43:59,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:43:59,320 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:43:59,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:43:59,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2115143577, now seen corresponding path program 1 times [2019-10-14 23:43:59,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:43:59,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870838857] [2019-10-14 23:43:59,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:59,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:59,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:43:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:59,608 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-14 23:43:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:59,639 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-14 23:43:59,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870838857] [2019-10-14 23:43:59,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:43:59,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:43:59,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345864053] [2019-10-14 23:43:59,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:43:59,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:43:59,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:43:59,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:43:59,644 INFO L87 Difference]: Start difference. First operand 450 states and 654 transitions. Second operand 4 states. [2019-10-14 23:44:01,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:01,559 INFO L93 Difference]: Finished difference Result 1304 states and 1892 transitions. [2019-10-14 23:44:01,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:44:01,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-14 23:44:01,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:01,567 INFO L225 Difference]: With dead ends: 1304 [2019-10-14 23:44:01,567 INFO L226 Difference]: Without dead ends: 886 [2019-10-14 23:44:01,570 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-10-14 23:44:01,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 452. [2019-10-14 23:44:01,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-14 23:44:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 656 transitions. [2019-10-14 23:44:01,614 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 656 transitions. Word has length 97 [2019-10-14 23:44:01,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:01,614 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 656 transitions. [2019-10-14 23:44:01,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:01,614 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 656 transitions. [2019-10-14 23:44:01,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-14 23:44:01,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:01,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:44:01,617 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:01,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:01,618 INFO L82 PathProgramCache]: Analyzing trace with hash 37790134, now seen corresponding path program 1 times [2019-10-14 23:44:01,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:01,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487995708] [2019-10-14 23:44:01,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:01,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:01,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:01,887 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-14 23:44:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:01,918 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-14 23:44:01,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487995708] [2019-10-14 23:44:01,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:01,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:01,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654799374] [2019-10-14 23:44:01,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:01,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:01,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:01,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:01,921 INFO L87 Difference]: Start difference. First operand 452 states and 656 transitions. Second operand 4 states. [2019-10-14 23:44:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:03,651 INFO L93 Difference]: Finished difference Result 1141 states and 1673 transitions. [2019-10-14 23:44:03,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:44:03,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-14 23:44:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:03,658 INFO L225 Difference]: With dead ends: 1141 [2019-10-14 23:44:03,658 INFO L226 Difference]: Without dead ends: 869 [2019-10-14 23:44:03,660 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:03,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2019-10-14 23:44:03,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 850. [2019-10-14 23:44:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-10-14 23:44:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1230 transitions. [2019-10-14 23:44:03,712 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1230 transitions. Word has length 98 [2019-10-14 23:44:03,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:03,713 INFO L462 AbstractCegarLoop]: Abstraction has 850 states and 1230 transitions. [2019-10-14 23:44:03,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1230 transitions. [2019-10-14 23:44:03,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-14 23:44:03,717 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:03,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:44:03,718 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:03,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:03,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1441582317, now seen corresponding path program 1 times [2019-10-14 23:44:03,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:03,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364535430] [2019-10-14 23:44:03,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:03,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:03,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:04,036 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-14 23:44:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:04,066 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-14 23:44:04,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364535430] [2019-10-14 23:44:04,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:04,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:04,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636894886] [2019-10-14 23:44:04,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:04,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:04,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:04,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:04,069 INFO L87 Difference]: Start difference. First operand 850 states and 1230 transitions. Second operand 5 states. [2019-10-14 23:44:05,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:05,220 INFO L93 Difference]: Finished difference Result 1334 states and 1945 transitions. [2019-10-14 23:44:05,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:05,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-14 23:44:05,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:05,225 INFO L225 Difference]: With dead ends: 1334 [2019-10-14 23:44:05,225 INFO L226 Difference]: Without dead ends: 654 [2019-10-14 23:44:05,226 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-10-14 23:44:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2019-10-14 23:44:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-10-14 23:44:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 940 transitions. [2019-10-14 23:44:05,260 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 940 transitions. Word has length 98 [2019-10-14 23:44:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:05,260 INFO L462 AbstractCegarLoop]: Abstraction has 654 states and 940 transitions. [2019-10-14 23:44:05,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 940 transitions. [2019-10-14 23:44:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-14 23:44:05,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:05,263 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:44:05,264 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:05,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:05,264 INFO L82 PathProgramCache]: Analyzing trace with hash 407293187, now seen corresponding path program 1 times [2019-10-14 23:44:05,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:05,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139778894] [2019-10-14 23:44:05,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:05,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:05,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:05,639 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-14 23:44:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:05,668 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-14 23:44:05,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139778894] [2019-10-14 23:44:05,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:05,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:05,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206305998] [2019-10-14 23:44:05,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:05,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:05,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:05,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:05,671 INFO L87 Difference]: Start difference. First operand 654 states and 940 transitions. Second operand 5 states. [2019-10-14 23:44:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:07,195 INFO L93 Difference]: Finished difference Result 1607 states and 2308 transitions. [2019-10-14 23:44:07,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:07,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-14 23:44:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:07,200 INFO L225 Difference]: With dead ends: 1607 [2019-10-14 23:44:07,201 INFO L226 Difference]: Without dead ends: 976 [2019-10-14 23:44:07,202 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-10-14 23:44:07,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 962. [2019-10-14 23:44:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-10-14 23:44:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1371 transitions. [2019-10-14 23:44:07,247 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1371 transitions. Word has length 100 [2019-10-14 23:44:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:07,247 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 1371 transitions. [2019-10-14 23:44:07,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1371 transitions. [2019-10-14 23:44:07,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-14 23:44:07,250 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:07,250 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:44:07,251 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:07,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:07,251 INFO L82 PathProgramCache]: Analyzing trace with hash 987827892, now seen corresponding path program 1 times [2019-10-14 23:44:07,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:07,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808411253] [2019-10-14 23:44:07,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:07,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:07,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:07,498 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-14 23:44:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:07,525 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-14 23:44:07,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808411253] [2019-10-14 23:44:07,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:07,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:07,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501594099] [2019-10-14 23:44:07,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:07,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:07,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:07,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:07,528 INFO L87 Difference]: Start difference. First operand 962 states and 1371 transitions. Second operand 4 states. [2019-10-14 23:44:09,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:09,249 INFO L93 Difference]: Finished difference Result 2376 states and 3448 transitions. [2019-10-14 23:44:09,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:44:09,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-14 23:44:09,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:09,259 INFO L225 Difference]: With dead ends: 2376 [2019-10-14 23:44:09,260 INFO L226 Difference]: Without dead ends: 1742 [2019-10-14 23:44:09,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:09,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-10-14 23:44:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1730. [2019-10-14 23:44:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1730 states. [2019-10-14 23:44:09,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2469 transitions. [2019-10-14 23:44:09,380 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2469 transitions. Word has length 102 [2019-10-14 23:44:09,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:09,380 INFO L462 AbstractCegarLoop]: Abstraction has 1730 states and 2469 transitions. [2019-10-14 23:44:09,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:09,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2469 transitions. [2019-10-14 23:44:09,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-14 23:44:09,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:09,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:44:09,385 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:09,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:09,385 INFO L82 PathProgramCache]: Analyzing trace with hash 945077457, now seen corresponding path program 1 times [2019-10-14 23:44:09,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:09,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669067482] [2019-10-14 23:44:09,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:09,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:09,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:09,693 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-14 23:44:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:09,736 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-14 23:44:09,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669067482] [2019-10-14 23:44:09,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:09,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:09,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518083279] [2019-10-14 23:44:09,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:09,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:09,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:09,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:09,740 INFO L87 Difference]: Start difference. First operand 1730 states and 2469 transitions. Second operand 5 states. [2019-10-14 23:44:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:10,914 INFO L93 Difference]: Finished difference Result 2605 states and 3741 transitions. [2019-10-14 23:44:10,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:10,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-14 23:44:10,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:10,924 INFO L225 Difference]: With dead ends: 2605 [2019-10-14 23:44:10,924 INFO L226 Difference]: Without dead ends: 1420 [2019-10-14 23:44:10,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:10,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2019-10-14 23:44:11,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420. [2019-10-14 23:44:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2019-10-14 23:44:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 2016 transitions. [2019-10-14 23:44:11,016 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 2016 transitions. Word has length 102 [2019-10-14 23:44:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:11,017 INFO L462 AbstractCegarLoop]: Abstraction has 1420 states and 2016 transitions. [2019-10-14 23:44:11,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2016 transitions. [2019-10-14 23:44:11,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-14 23:44:11,021 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:11,022 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:44:11,022 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:11,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:11,023 INFO L82 PathProgramCache]: Analyzing trace with hash -250804370, now seen corresponding path program 1 times [2019-10-14 23:44:11,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:11,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218617319] [2019-10-14 23:44:11,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:11,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:11,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:11,364 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-14 23:44:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:11,395 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-14 23:44:11,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218617319] [2019-10-14 23:44:11,395 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:11,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:11,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309754565] [2019-10-14 23:44:11,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:11,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:11,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:11,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:11,402 INFO L87 Difference]: Start difference. First operand 1420 states and 2016 transitions. Second operand 4 states. [2019-10-14 23:44:11,640 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2019-10-14 23:44:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:12,811 INFO L93 Difference]: Finished difference Result 3489 states and 5085 transitions. [2019-10-14 23:44:12,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:12,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-14 23:44:12,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:12,833 INFO L225 Difference]: With dead ends: 3489 [2019-10-14 23:44:12,833 INFO L226 Difference]: Without dead ends: 2583 [2019-10-14 23:44:12,836 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:12,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-10-14 23:44:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2515. [2019-10-14 23:44:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2515 states. [2019-10-14 23:44:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 3610 transitions. [2019-10-14 23:44:12,951 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 3610 transitions. Word has length 104 [2019-10-14 23:44:12,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:12,952 INFO L462 AbstractCegarLoop]: Abstraction has 2515 states and 3610 transitions. [2019-10-14 23:44:12,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 3610 transitions. [2019-10-14 23:44:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-14 23:44:12,956 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:12,957 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:44:12,957 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:12,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:12,957 INFO L82 PathProgramCache]: Analyzing trace with hash 858846089, now seen corresponding path program 1 times [2019-10-14 23:44:12,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:12,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093956848] [2019-10-14 23:44:12,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:12,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:12,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:13,306 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-14 23:44:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:13,347 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-14 23:44:13,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093956848] [2019-10-14 23:44:13,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:13,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:13,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476506920] [2019-10-14 23:44:13,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:13,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:13,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:13,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:13,354 INFO L87 Difference]: Start difference. First operand 2515 states and 3610 transitions. Second operand 5 states. [2019-10-14 23:44:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:15,066 INFO L93 Difference]: Finished difference Result 7288 states and 10449 transitions. [2019-10-14 23:44:15,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:15,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-14 23:44:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:15,088 INFO L225 Difference]: With dead ends: 7288 [2019-10-14 23:44:15,089 INFO L226 Difference]: Without dead ends: 4816 [2019-10-14 23:44:15,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2019-10-14 23:44:15,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 4748. [2019-10-14 23:44:15,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4748 states. [2019-10-14 23:44:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4748 states to 4748 states and 6753 transitions. [2019-10-14 23:44:15,322 INFO L78 Accepts]: Start accepts. Automaton has 4748 states and 6753 transitions. Word has length 104 [2019-10-14 23:44:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:15,323 INFO L462 AbstractCegarLoop]: Abstraction has 4748 states and 6753 transitions. [2019-10-14 23:44:15,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:15,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4748 states and 6753 transitions. [2019-10-14 23:44:15,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:44:15,330 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:15,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:44:15,331 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:15,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:15,331 INFO L82 PathProgramCache]: Analyzing trace with hash 870236013, now seen corresponding path program 1 times [2019-10-14 23:44:15,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:15,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825725196] [2019-10-14 23:44:15,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:15,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:15,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:15,559 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-14 23:44:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:15,582 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-14 23:44:15,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825725196] [2019-10-14 23:44:15,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:15,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:15,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049803505] [2019-10-14 23:44:15,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:15,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:15,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:15,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:15,585 INFO L87 Difference]: Start difference. First operand 4748 states and 6753 transitions. Second operand 4 states. [2019-10-14 23:44:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:16,887 INFO L93 Difference]: Finished difference Result 14046 states and 20004 transitions. [2019-10-14 23:44:16,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:44:16,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-14 23:44:16,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:16,925 INFO L225 Difference]: With dead ends: 14046 [2019-10-14 23:44:16,925 INFO L226 Difference]: Without dead ends: 9406 [2019-10-14 23:44:16,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9406 states. [2019-10-14 23:44:17,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9406 to 4754. [2019-10-14 23:44:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4754 states. [2019-10-14 23:44:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 6759 transitions. [2019-10-14 23:44:17,281 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 6759 transitions. Word has length 105 [2019-10-14 23:44:17,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:17,282 INFO L462 AbstractCegarLoop]: Abstraction has 4754 states and 6759 transitions. [2019-10-14 23:44:17,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 6759 transitions. [2019-10-14 23:44:17,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:44:17,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:17,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:44:17,289 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:17,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:17,289 INFO L82 PathProgramCache]: Analyzing trace with hash -95586230, now seen corresponding path program 1 times [2019-10-14 23:44:17,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:17,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890503193] [2019-10-14 23:44:17,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:17,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:17,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:17,581 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-14 23:44:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:17,606 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-14 23:44:17,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890503193] [2019-10-14 23:44:17,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:17,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:17,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121484927] [2019-10-14 23:44:17,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:17,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:17,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:17,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:17,609 INFO L87 Difference]: Start difference. First operand 4754 states and 6759 transitions. Second operand 5 states. [2019-10-14 23:44:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:18,649 INFO L93 Difference]: Finished difference Result 9466 states and 13462 transitions. [2019-10-14 23:44:18,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:18,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-14 23:44:18,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:18,673 INFO L225 Difference]: With dead ends: 9466 [2019-10-14 23:44:18,673 INFO L226 Difference]: Without dead ends: 4748 [2019-10-14 23:44:18,681 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2019-10-14 23:44:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 4748. [2019-10-14 23:44:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4748 states. [2019-10-14 23:44:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4748 states to 4748 states and 6747 transitions. [2019-10-14 23:44:18,893 INFO L78 Accepts]: Start accepts. Automaton has 4748 states and 6747 transitions. Word has length 106 [2019-10-14 23:44:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:18,894 INFO L462 AbstractCegarLoop]: Abstraction has 4748 states and 6747 transitions. [2019-10-14 23:44:18,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 4748 states and 6747 transitions. [2019-10-14 23:44:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:44:18,900 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:18,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:44:18,900 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:18,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:18,901 INFO L82 PathProgramCache]: Analyzing trace with hash -500434516, now seen corresponding path program 1 times [2019-10-14 23:44:18,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:18,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434565841] [2019-10-14 23:44:18,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:18,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:18,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:19,142 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-14 23:44:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:19,172 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-14 23:44:19,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434565841] [2019-10-14 23:44:19,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:19,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:19,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291714672] [2019-10-14 23:44:19,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:19,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:19,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:19,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:19,175 INFO L87 Difference]: Start difference. First operand 4748 states and 6747 transitions. Second operand 4 states. [2019-10-14 23:44:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:20,974 INFO L93 Difference]: Finished difference Result 10891 states and 15571 transitions. [2019-10-14 23:44:20,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:44:20,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-14 23:44:20,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:20,991 INFO L225 Difference]: With dead ends: 10891 [2019-10-14 23:44:20,991 INFO L226 Difference]: Without dead ends: 7075 [2019-10-14 23:44:20,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7075 states. [2019-10-14 23:44:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7075 to 7007. [2019-10-14 23:44:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7007 states. [2019-10-14 23:44:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7007 states to 7007 states and 9789 transitions. [2019-10-14 23:44:21,444 INFO L78 Accepts]: Start accepts. Automaton has 7007 states and 9789 transitions. Word has length 106 [2019-10-14 23:44:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:21,445 INFO L462 AbstractCegarLoop]: Abstraction has 7007 states and 9789 transitions. [2019-10-14 23:44:21,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:21,445 INFO L276 IsEmpty]: Start isEmpty. Operand 7007 states and 9789 transitions. [2019-10-14 23:44:21,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-14 23:44:21,455 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:21,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:44:21,456 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:21,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:21,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1963079784, now seen corresponding path program 1 times [2019-10-14 23:44:21,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:21,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368081453] [2019-10-14 23:44:21,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:21,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:21,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:21,925 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-14 23:44:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:21,966 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-14 23:44:21,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368081453] [2019-10-14 23:44:21,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:21,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-14 23:44:21,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621307974] [2019-10-14 23:44:21,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-14 23:44:21,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:21,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-14 23:44:21,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:44:21,968 INFO L87 Difference]: Start difference. First operand 7007 states and 9789 transitions. Second operand 13 states. [2019-10-14 23:44:22,255 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-10-14 23:44:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:24,960 INFO L93 Difference]: Finished difference Result 22484 states and 33494 transitions. [2019-10-14 23:44:24,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:44:24,961 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2019-10-14 23:44:24,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:25,001 INFO L225 Difference]: With dead ends: 22484 [2019-10-14 23:44:25,002 INFO L226 Difference]: Without dead ends: 18976 [2019-10-14 23:44:25,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:44:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18976 states. [2019-10-14 23:44:26,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18976 to 15722. [2019-10-14 23:44:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15722 states. [2019-10-14 23:44:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15722 states to 15722 states and 22674 transitions. [2019-10-14 23:44:26,085 INFO L78 Accepts]: Start accepts. Automaton has 15722 states and 22674 transitions. Word has length 108 [2019-10-14 23:44:26,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:26,085 INFO L462 AbstractCegarLoop]: Abstraction has 15722 states and 22674 transitions. [2019-10-14 23:44:26,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-14 23:44:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 15722 states and 22674 transitions. [2019-10-14 23:44:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-14 23:44:26,099 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:26,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:44:26,099 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:26,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:26,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1808632579, now seen corresponding path program 1 times [2019-10-14 23:44:26,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:26,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409455831] [2019-10-14 23:44:26,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:26,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:26,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:26,437 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-14 23:44:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:26,463 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-14 23:44:26,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409455831] [2019-10-14 23:44:26,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:26,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:44:26,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92430618] [2019-10-14 23:44:26,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:44:26,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:26,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:44:26,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:44:26,465 INFO L87 Difference]: Start difference. First operand 15722 states and 22674 transitions. Second operand 9 states. [2019-10-14 23:44:26,686 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 164