/usr/bin/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_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:15:13,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:15:13,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:15:13,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:15:13,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:15:13,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:15:13,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:15:13,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:15:13,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:15:13,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:15:13,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:15:13,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:15:13,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:15:13,973 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:15:13,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:15:13,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:15:13,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:15:13,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:15:13,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:15:13,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:15:13,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:15:13,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:15:13,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:15:13,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:15:13,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:15:13,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:15:13,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:15:13,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:15:13,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:15:14,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:15:14,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:15:14,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:15:14,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:15:14,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:15:14,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:15:14,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:15:14,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:15:14,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:15:14,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:15:14,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:15:14,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:15:14,008 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-11-06 22:15:14,034 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:15:14,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:15:14,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:15:14,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:15:14,036 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:15:14,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:15:14,036 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:15:14,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:15:14,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:15:14,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:15:14,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:15:14,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:15:14,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:15:14,037 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:15:14,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:15:14,038 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:15:14,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:15:14,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:15:14,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:15:14,039 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:15:14,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:15:14,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:15:14,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:15:14,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:15:14,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:15:14,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:15:14,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:15:14,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:15:14,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:15:14,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:15:14,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:15:14,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:15:14,316 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:15:14,316 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:15:14,317 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-06 22:15:14,380 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9073c587d/bf115ec435a04895a0de2d4fc2b29782/FLAGde1e47411 [2019-11-06 22:15:14,859 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:15:14,860 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-06 22:15:14,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9073c587d/bf115ec435a04895a0de2d4fc2b29782/FLAGde1e47411 [2019-11-06 22:15:15,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9073c587d/bf115ec435a04895a0de2d4fc2b29782 [2019-11-06 22:15:15,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:15:15,214 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:15:15,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:15:15,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:15:15,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:15:15,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:15" (1/1) ... [2019-11-06 22:15:15,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6689ec52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:15, skipping insertion in model container [2019-11-06 22:15:15,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:15" (1/1) ... [2019-11-06 22:15:15,232 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:15:15,314 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:15:15,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:15:15,875 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:15:16,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:15:16,270 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:15:16,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:16 WrapperNode [2019-11-06 22:15:16,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:15:16,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:15:16,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:15:16,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:15:16,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:16" (1/1) ... [2019-11-06 22:15:16,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:16" (1/1) ... [2019-11-06 22:15:16,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:16" (1/1) ... [2019-11-06 22:15:16,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:16" (1/1) ... [2019-11-06 22:15:16,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:16" (1/1) ... [2019-11-06 22:15:16,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:16" (1/1) ... [2019-11-06 22:15:16,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:16" (1/1) ... [2019-11-06 22:15:16,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:15:16,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:15:16,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:15:16,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:15:16,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:16" (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-11-06 22:15:16,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:15:16,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:15:16,518 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:15:16,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:15:16,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:15:16,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-06 22:15:16,519 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-06 22:15:16,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:15:16,520 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-06 22:15:16,520 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-06 22:15:16,520 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-06 22:15:16,520 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-06 22:15:16,521 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-06 22:15:16,521 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-06 22:15:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-06 22:15:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:15:16,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:15:16,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:15:17,931 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:15:17,931 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 22:15:17,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:17 BoogieIcfgContainer [2019-11-06 22:15:17,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:15:17,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:15:17,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:15:17,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:15:17,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:15:15" (1/3) ... [2019-11-06 22:15:17,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7255d402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:17, skipping insertion in model container [2019-11-06 22:15:17,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:16" (2/3) ... [2019-11-06 22:15:17,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7255d402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:17, skipping insertion in model container [2019-11-06 22:15:17,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:17" (3/3) ... [2019-11-06 22:15:17,947 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-06 22:15:17,959 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:15:17,984 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:15:17,999 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:15:18,042 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:15:18,043 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:15:18,043 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:15:18,043 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:15:18,043 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:15:18,043 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:15:18,043 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:15:18,043 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:15:18,081 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states. [2019-11-06 22:15:18,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-06 22:15:18,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:18,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:18,107 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:18,112 INFO L82 PathProgramCache]: Analyzing trace with hash 415390772, now seen corresponding path program 1 times [2019-11-06 22:15:18,120 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:18,120 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919812834] [2019-11-06 22:15:18,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:19,089 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:19,158 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919812834] [2019-11-06 22:15:19,159 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:19,159 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:19,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361531291] [2019-11-06 22:15:19,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:19,167 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:19,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:19,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:19,184 INFO L87 Difference]: Start difference. First operand 329 states. Second operand 4 states. [2019-11-06 22:15:19,522 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-11-06 22:15:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:21,255 INFO L93 Difference]: Finished difference Result 629 states and 1092 transitions. [2019-11-06 22:15:21,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:21,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-06 22:15:21,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:21,277 INFO L225 Difference]: With dead ends: 629 [2019-11-06 22:15:21,278 INFO L226 Difference]: Without dead ends: 514 [2019-11-06 22:15:21,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-06 22:15:21,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-11-06 22:15:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-06 22:15:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 761 transitions. [2019-11-06 22:15:21,438 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 761 transitions. Word has length 154 [2019-11-06 22:15:21,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:21,441 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 761 transitions. [2019-11-06 22:15:21,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:21,441 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 761 transitions. [2019-11-06 22:15:21,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-06 22:15:21,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:21,454 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:21,454 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:21,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1479062648, now seen corresponding path program 1 times [2019-11-06 22:15:21,455 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:21,455 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185508741] [2019-11-06 22:15:21,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:22,276 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:22,327 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185508741] [2019-11-06 22:15:22,328 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:22,328 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:22,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673123792] [2019-11-06 22:15:22,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:15:22,331 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:22,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:15:22,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:22,334 INFO L87 Difference]: Start difference. First operand 512 states and 761 transitions. Second operand 5 states. [2019-11-06 22:15:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:24,480 INFO L93 Difference]: Finished difference Result 1493 states and 2216 transitions. [2019-11-06 22:15:24,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:24,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-11-06 22:15:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:24,490 INFO L225 Difference]: With dead ends: 1493 [2019-11-06 22:15:24,490 INFO L226 Difference]: Without dead ends: 994 [2019-11-06 22:15:24,494 INFO L630 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-11-06 22:15:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-11-06 22:15:24,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 992. [2019-11-06 22:15:24,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-11-06 22:15:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1463 transitions. [2019-11-06 22:15:24,547 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1463 transitions. Word has length 154 [2019-11-06 22:15:24,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:24,547 INFO L462 AbstractCegarLoop]: Abstraction has 992 states and 1463 transitions. [2019-11-06 22:15:24,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:15:24,548 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1463 transitions. [2019-11-06 22:15:24,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-06 22:15:24,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:24,551 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:24,552 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:24,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:24,552 INFO L82 PathProgramCache]: Analyzing trace with hash 203763094, now seen corresponding path program 1 times [2019-11-06 22:15:24,553 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:24,553 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308485882] [2019-11-06 22:15:24,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:24,857 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:24,888 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308485882] [2019-11-06 22:15:24,888 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:24,888 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:24,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246265391] [2019-11-06 22:15:24,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:24,889 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:24,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:24,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:24,890 INFO L87 Difference]: Start difference. First operand 992 states and 1463 transitions. Second operand 4 states. [2019-11-06 22:15:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:27,020 INFO L93 Difference]: Finished difference Result 2930 states and 4319 transitions. [2019-11-06 22:15:27,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:27,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-06 22:15:27,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:27,033 INFO L225 Difference]: With dead ends: 2930 [2019-11-06 22:15:27,034 INFO L226 Difference]: Without dead ends: 1970 [2019-11-06 22:15:27,036 INFO L630 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-11-06 22:15:27,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2019-11-06 22:15:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 994. [2019-11-06 22:15:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-11-06 22:15:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1465 transitions. [2019-11-06 22:15:27,099 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1465 transitions. Word has length 155 [2019-11-06 22:15:27,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:27,099 INFO L462 AbstractCegarLoop]: Abstraction has 994 states and 1465 transitions. [2019-11-06 22:15:27,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:27,100 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1465 transitions. [2019-11-06 22:15:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-06 22:15:27,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:27,102 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:27,103 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:27,103 INFO L82 PathProgramCache]: Analyzing trace with hash -691639607, now seen corresponding path program 1 times [2019-11-06 22:15:27,104 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:27,104 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926393858] [2019-11-06 22:15:27,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:27,535 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:27,573 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926393858] [2019-11-06 22:15:27,573 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:27,573 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:27,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639237556] [2019-11-06 22:15:27,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:15:27,575 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:27,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:15:27,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:27,575 INFO L87 Difference]: Start difference. First operand 994 states and 1465 transitions. Second operand 5 states. [2019-11-06 22:15:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:29,073 INFO L93 Difference]: Finished difference Result 1970 states and 2905 transitions. [2019-11-06 22:15:29,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:29,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-11-06 22:15:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:29,079 INFO L225 Difference]: With dead ends: 1970 [2019-11-06 22:15:29,079 INFO L226 Difference]: Without dead ends: 994 [2019-11-06 22:15:29,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:15:29,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-11-06 22:15:29,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 993. [2019-11-06 22:15:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-11-06 22:15:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1462 transitions. [2019-11-06 22:15:29,126 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1462 transitions. Word has length 156 [2019-11-06 22:15:29,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:29,126 INFO L462 AbstractCegarLoop]: Abstraction has 993 states and 1462 transitions. [2019-11-06 22:15:29,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:15:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1462 transitions. [2019-11-06 22:15:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-06 22:15:29,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:29,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:29,130 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:29,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:29,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2145460590, now seen corresponding path program 1 times [2019-11-06 22:15:29,131 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:29,131 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030480098] [2019-11-06 22:15:29,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:29,539 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:29,579 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030480098] [2019-11-06 22:15:29,579 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:29,579 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:29,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487140980] [2019-11-06 22:15:29,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:15:29,581 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:29,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:15:29,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:29,582 INFO L87 Difference]: Start difference. First operand 993 states and 1462 transitions. Second operand 5 states. [2019-11-06 22:15:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:30,978 INFO L93 Difference]: Finished difference Result 1973 states and 2907 transitions. [2019-11-06 22:15:30,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:30,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-11-06 22:15:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:30,984 INFO L225 Difference]: With dead ends: 1973 [2019-11-06 22:15:30,984 INFO L226 Difference]: Without dead ends: 991 [2019-11-06 22:15:30,986 INFO L630 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-11-06 22:15:30,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-11-06 22:15:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2019-11-06 22:15:31,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-11-06 22:15:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1458 transitions. [2019-11-06 22:15:31,029 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1458 transitions. Word has length 156 [2019-11-06 22:15:31,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:31,029 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1458 transitions. [2019-11-06 22:15:31,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:15:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1458 transitions. [2019-11-06 22:15:31,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-06 22:15:31,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:31,032 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:31,033 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:31,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:31,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1752535471, now seen corresponding path program 1 times [2019-11-06 22:15:31,033 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:31,034 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538468431] [2019-11-06 22:15:31,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:31,322 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:31,364 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538468431] [2019-11-06 22:15:31,364 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:31,364 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:31,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983430117] [2019-11-06 22:15:31,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:31,365 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:31,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:31,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:31,366 INFO L87 Difference]: Start difference. First operand 991 states and 1458 transitions. Second operand 4 states. [2019-11-06 22:15:33,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:33,706 INFO L93 Difference]: Finished difference Result 2257 states and 3335 transitions. [2019-11-06 22:15:33,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:33,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-06 22:15:33,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:33,718 INFO L225 Difference]: With dead ends: 2257 [2019-11-06 22:15:33,718 INFO L226 Difference]: Without dead ends: 1462 [2019-11-06 22:15:33,723 INFO L630 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-11-06 22:15:33,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2019-11-06 22:15:33,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1460. [2019-11-06 22:15:33,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2019-11-06 22:15:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2122 transitions. [2019-11-06 22:15:33,779 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2122 transitions. Word has length 156 [2019-11-06 22:15:33,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:33,780 INFO L462 AbstractCegarLoop]: Abstraction has 1460 states and 2122 transitions. [2019-11-06 22:15:33,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:33,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2122 transitions. [2019-11-06 22:15:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-06 22:15:33,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:33,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:33,784 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:33,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:33,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1902063682, now seen corresponding path program 1 times [2019-11-06 22:15:33,785 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:33,785 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168139483] [2019-11-06 22:15:33,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:34,065 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:34,133 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168139483] [2019-11-06 22:15:34,133 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:34,133 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:34,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378231874] [2019-11-06 22:15:34,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:34,134 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:34,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:34,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:34,136 INFO L87 Difference]: Start difference. First operand 1460 states and 2122 transitions. Second operand 4 states. [2019-11-06 22:15:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:35,661 INFO L93 Difference]: Finished difference Result 3179 states and 4753 transitions. [2019-11-06 22:15:35,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:35,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-06 22:15:35,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:35,672 INFO L225 Difference]: With dead ends: 3179 [2019-11-06 22:15:35,673 INFO L226 Difference]: Without dead ends: 1908 [2019-11-06 22:15:35,676 INFO L630 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-11-06 22:15:35,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2019-11-06 22:15:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1876. [2019-11-06 22:15:35,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1876 states. [2019-11-06 22:15:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2798 transitions. [2019-11-06 22:15:35,751 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2798 transitions. Word has length 157 [2019-11-06 22:15:35,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:35,751 INFO L462 AbstractCegarLoop]: Abstraction has 1876 states and 2798 transitions. [2019-11-06 22:15:35,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2798 transitions. [2019-11-06 22:15:35,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-06 22:15:35,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:35,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:35,756 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:35,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:35,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1819575298, now seen corresponding path program 1 times [2019-11-06 22:15:35,756 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:35,757 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511015519] [2019-11-06 22:15:35,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:36,203 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:36,244 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511015519] [2019-11-06 22:15:36,245 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:36,245 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:36,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832888174] [2019-11-06 22:15:36,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:15:36,247 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:15:36,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:36,248 INFO L87 Difference]: Start difference. First operand 1876 states and 2798 transitions. Second operand 5 states. [2019-11-06 22:15:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:38,469 INFO L93 Difference]: Finished difference Result 4810 states and 7177 transitions. [2019-11-06 22:15:38,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:38,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-11-06 22:15:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:38,482 INFO L225 Difference]: With dead ends: 4810 [2019-11-06 22:15:38,482 INFO L226 Difference]: Without dead ends: 2965 [2019-11-06 22:15:38,486 INFO L630 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-11-06 22:15:38,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2019-11-06 22:15:38,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2963. [2019-11-06 22:15:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2963 states. [2019-11-06 22:15:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 4385 transitions. [2019-11-06 22:15:38,603 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 4385 transitions. Word has length 160 [2019-11-06 22:15:38,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:38,603 INFO L462 AbstractCegarLoop]: Abstraction has 2963 states and 4385 transitions. [2019-11-06 22:15:38,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:15:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 4385 transitions. [2019-11-06 22:15:38,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-06 22:15:38,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:38,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:38,608 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:38,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:38,609 INFO L82 PathProgramCache]: Analyzing trace with hash -489223043, now seen corresponding path program 1 times [2019-11-06 22:15:38,609 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:38,609 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788962926] [2019-11-06 22:15:38,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:38,945 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:38,992 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788962926] [2019-11-06 22:15:38,992 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:38,993 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:38,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484275755] [2019-11-06 22:15:38,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:38,993 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:38,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:38,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:38,994 INFO L87 Difference]: Start difference. First operand 2963 states and 4385 transitions. Second operand 4 states. [2019-11-06 22:15:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:41,168 INFO L93 Difference]: Finished difference Result 7148 states and 10640 transitions. [2019-11-06 22:15:41,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:41,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-06 22:15:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:41,190 INFO L225 Difference]: With dead ends: 7148 [2019-11-06 22:15:41,190 INFO L226 Difference]: Without dead ends: 4544 [2019-11-06 22:15:41,196 INFO L630 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-11-06 22:15:41,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4544 states. [2019-11-06 22:15:41,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4544 to 4542. [2019-11-06 22:15:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4542 states. [2019-11-06 22:15:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4542 states to 4542 states and 6645 transitions. [2019-11-06 22:15:41,389 INFO L78 Accepts]: Start accepts. Automaton has 4542 states and 6645 transitions. Word has length 162 [2019-11-06 22:15:41,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:41,389 INFO L462 AbstractCegarLoop]: Abstraction has 4542 states and 6645 transitions. [2019-11-06 22:15:41,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:41,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4542 states and 6645 transitions. [2019-11-06 22:15:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-06 22:15:41,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:41,400 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:41,401 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:41,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:41,405 INFO L82 PathProgramCache]: Analyzing trace with hash -598358062, now seen corresponding path program 1 times [2019-11-06 22:15:41,405 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:41,410 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333260729] [2019-11-06 22:15:41,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:41,730 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:41,762 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333260729] [2019-11-06 22:15:41,763 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:41,763 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:41,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929076161] [2019-11-06 22:15:41,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:41,764 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:41,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:41,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:41,764 INFO L87 Difference]: Start difference. First operand 4542 states and 6645 transitions. Second operand 4 states. [2019-11-06 22:15:42,032 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-11-06 22:15:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:43,644 INFO L93 Difference]: Finished difference Result 12098 states and 17966 transitions. [2019-11-06 22:15:43,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:43,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-06 22:15:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:43,674 INFO L225 Difference]: With dead ends: 12098 [2019-11-06 22:15:43,674 INFO L226 Difference]: Without dead ends: 8790 [2019-11-06 22:15:43,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8790 states. [2019-11-06 22:15:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8790 to 8788. [2019-11-06 22:15:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8788 states. [2019-11-06 22:15:44,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8788 states to 8788 states and 12891 transitions. [2019-11-06 22:15:44,064 INFO L78 Accepts]: Start accepts. Automaton has 8788 states and 12891 transitions. Word has length 166 [2019-11-06 22:15:44,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:44,065 INFO L462 AbstractCegarLoop]: Abstraction has 8788 states and 12891 transitions. [2019-11-06 22:15:44,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:44,065 INFO L276 IsEmpty]: Start isEmpty. Operand 8788 states and 12891 transitions. [2019-11-06 22:15:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-06 22:15:44,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:44,075 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:44,075 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:44,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash 875092589, now seen corresponding path program 1 times [2019-11-06 22:15:44,075 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:44,076 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626917373] [2019-11-06 22:15:44,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:44,448 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:44,508 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626917373] [2019-11-06 22:15:44,508 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:44,508 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 22:15:44,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883980427] [2019-11-06 22:15:44,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:15:44,509 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:44,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:15:44,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:15:44,510 INFO L87 Difference]: Start difference. First operand 8788 states and 12891 transitions. Second operand 9 states. [2019-11-06 22:15:44,772 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-11-06 22:15:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:47,317 INFO L93 Difference]: Finished difference Result 29662 states and 44875 transitions. [2019-11-06 22:15:47,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 22:15:47,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 166 [2019-11-06 22:15:47,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:47,371 INFO L225 Difference]: With dead ends: 29662 [2019-11-06 22:15:47,371 INFO L226 Difference]: Without dead ends: 21434 [2019-11-06 22:15:47,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:15:47,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21434 states. [2019-11-06 22:15:48,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21434 to 12552. [2019-11-06 22:15:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12552 states. [2019-11-06 22:15:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12552 states to 12552 states and 18471 transitions. [2019-11-06 22:15:48,171 INFO L78 Accepts]: Start accepts. Automaton has 12552 states and 18471 transitions. Word has length 166 [2019-11-06 22:15:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:48,172 INFO L462 AbstractCegarLoop]: Abstraction has 12552 states and 18471 transitions. [2019-11-06 22:15:48,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 22:15:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 12552 states and 18471 transitions. [2019-11-06 22:15:48,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-06 22:15:48,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:48,182 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:48,182 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:48,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:48,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2101346563, now seen corresponding path program 1 times [2019-11-06 22:15:48,183 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:48,183 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501233470] [2019-11-06 22:15:48,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:48,565 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:48,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:48,611 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501233470] [2019-11-06 22:15:48,611 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:48,611 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:48,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578264870] [2019-11-06 22:15:48,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:15:48,612 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:48,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:15:48,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:48,613 INFO L87 Difference]: Start difference. First operand 12552 states and 18471 transitions. Second operand 5 states.