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/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:45:46,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:45:46,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:45:46,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:45:46,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:45:46,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:45:46,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:45:46,945 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:45:46,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:45:46,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:45:46,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:45:46,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:45:46,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:45:46,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:45:46,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:45:46,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:45:46,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:45:46,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:45:46,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:45:46,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:45:46,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:45:46,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:45:46,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:45:46,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:45:46,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:45:46,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:45:46,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:45:46,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:45:46,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:45:46,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:45:46,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:45:46,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:45:46,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:45:46,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:45:46,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:45:46,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:45:46,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:45:46,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:45:46,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:45:46,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:45:46,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:45:46,981 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:45:47,001 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:45:47,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:45:47,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:45:47,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:45:47,004 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:45:47,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:45:47,004 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:45:47,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:45:47,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:45:47,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:45:47,006 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:45:47,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:45:47,006 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:45:47,007 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:45:47,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:45:47,007 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:45:47,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:45:47,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:45:47,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:45:47,008 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:45:47,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:45:47,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:45:47,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:45:47,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:45:47,009 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:45:47,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:45:47,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:45:47,010 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:45:47,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:45:47,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:45:47,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:45:47,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:45:47,303 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:45:47,304 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:45:47,304 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-14 23:45:47,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7c6dc38/6a0e31ec36df4ea3a5c1d0b154383b66/FLAG0f806260a [2019-10-14 23:45:47,918 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:45:47,918 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-14 23:45:47,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7c6dc38/6a0e31ec36df4ea3a5c1d0b154383b66/FLAG0f806260a [2019-10-14 23:45:48,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7c6dc38/6a0e31ec36df4ea3a5c1d0b154383b66 [2019-10-14 23:45:48,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:45:48,250 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:45:48,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:45:48,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:45:48,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:45:48,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:45:48" (1/1) ... [2019-10-14 23:45:48,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d974c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:48, skipping insertion in model container [2019-10-14 23:45:48,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:45:48" (1/1) ... [2019-10-14 23:45:48,267 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:45:48,304 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:45:48,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:45:48,658 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:45:48,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:45:48,769 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:45:48,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:48 WrapperNode [2019-10-14 23:45:48,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:45:48,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:45:48,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:45:48,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:45:48,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:48" (1/1) ... [2019-10-14 23:45:48,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:48" (1/1) ... [2019-10-14 23:45:48,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:48" (1/1) ... [2019-10-14 23:45:48,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:48" (1/1) ... [2019-10-14 23:45:48,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:48" (1/1) ... [2019-10-14 23:45:48,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:48" (1/1) ... [2019-10-14 23:45:48,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:48" (1/1) ... [2019-10-14 23:45:48,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:45:48,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:45:48,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:45:48,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:45:48,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:48" (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:45:48,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:45:48,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:45:48,905 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-10-14 23:45:48,906 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-10-14 23:45:48,906 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-10-14 23:45:48,906 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-10-14 23:45:48,906 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-10-14 23:45:48,906 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-14 23:45:48,906 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-14 23:45:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-10-14 23:45:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-10-14 23:45:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-10-14 23:45:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-10-14 23:45:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:45:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-14 23:45:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:45:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:45:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-14 23:45:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-14 23:45:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-14 23:45:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:45:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-14 23:45:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-10-14 23:45:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-10-14 23:45:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-10-14 23:45:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-10-14 23:45:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-10-14 23:45:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-14 23:45:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-14 23:45:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-10-14 23:45:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-10-14 23:45:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-10-14 23:45:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-10-14 23:45:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:45:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:45:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:45:49,744 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:45:49,745 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 23:45:49,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:45:49 BoogieIcfgContainer [2019-10-14 23:45:49,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:45:49,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:45:49,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:45:49,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:45:49,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:45:48" (1/3) ... [2019-10-14 23:45:49,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a070f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:45:49, skipping insertion in model container [2019-10-14 23:45:49,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:48" (2/3) ... [2019-10-14 23:45:49,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a070f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:45:49, skipping insertion in model container [2019-10-14 23:45:49,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:45:49" (3/3) ... [2019-10-14 23:45:49,754 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-14 23:45:49,763 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:45:49,771 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:45:49,781 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:45:49,806 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:45:49,807 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:45:49,807 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:45:49,807 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:45:49,807 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:45:49,807 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:45:49,808 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:45:49,808 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:45:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states. [2019-10-14 23:45:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:45:49,842 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:49,843 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] [2019-10-14 23:45:49,846 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:49,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:49,852 INFO L82 PathProgramCache]: Analyzing trace with hash 310880814, now seen corresponding path program 1 times [2019-10-14 23:45:49,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:49,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97817929] [2019-10-14 23:45:49,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:49,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:49,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:50,316 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-14 23:45:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:50,371 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:45:50,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97817929] [2019-10-14 23:45:50,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:50,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:50,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662723536] [2019-10-14 23:45:50,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:50,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:50,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:50,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:50,391 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 5 states. [2019-10-14 23:45:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:52,068 INFO L93 Difference]: Finished difference Result 416 states and 679 transitions. [2019-10-14 23:45:52,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:45:52,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-14 23:45:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:52,102 INFO L225 Difference]: With dead ends: 416 [2019-10-14 23:45:52,102 INFO L226 Difference]: Without dead ends: 216 [2019-10-14 23:45:52,109 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:45:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-10-14 23:45:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2019-10-14 23:45:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-14 23:45:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 313 transitions. [2019-10-14 23:45:52,192 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 313 transitions. Word has length 21 [2019-10-14 23:45:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:52,193 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 313 transitions. [2019-10-14 23:45:52,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 313 transitions. [2019-10-14 23:45:52,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:45:52,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:52,196 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] [2019-10-14 23:45:52,196 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:52,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:52,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1405375627, now seen corresponding path program 1 times [2019-10-14 23:45:52,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:52,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436055237] [2019-10-14 23:45:52,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:52,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:52,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:52,410 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:45:52,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436055237] [2019-10-14 23:45:52,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:52,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:52,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865284583] [2019-10-14 23:45:52,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:52,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:52,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:52,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:52,414 INFO L87 Difference]: Start difference. First operand 210 states and 313 transitions. Second operand 5 states. [2019-10-14 23:45:52,649 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-10-14 23:45:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:53,858 INFO L93 Difference]: Finished difference Result 431 states and 649 transitions. [2019-10-14 23:45:53,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:45:53,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-14 23:45:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:53,863 INFO L225 Difference]: With dead ends: 431 [2019-10-14 23:45:53,863 INFO L226 Difference]: Without dead ends: 230 [2019-10-14 23:45:53,866 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:45:53,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-14 23:45:53,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2019-10-14 23:45:53,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-14 23:45:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 329 transitions. [2019-10-14 23:45:53,940 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 329 transitions. Word has length 22 [2019-10-14 23:45:53,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:53,945 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 329 transitions. [2019-10-14 23:45:53,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:53,946 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 329 transitions. [2019-10-14 23:45:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:45:53,956 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:53,957 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:53,957 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:53,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:53,958 INFO L82 PathProgramCache]: Analyzing trace with hash -152672816, now seen corresponding path program 1 times [2019-10-14 23:45:53,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:53,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231637190] [2019-10-14 23:45:53,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:53,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:53,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:54,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231637190] [2019-10-14 23:45:54,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:54,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:54,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947400082] [2019-10-14 23:45:54,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:54,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:54,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:54,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:54,147 INFO L87 Difference]: Start difference. First operand 223 states and 329 transitions. Second operand 4 states. [2019-10-14 23:45:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:55,192 INFO L93 Difference]: Finished difference Result 463 states and 695 transitions. [2019-10-14 23:45:55,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:55,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-14 23:45:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:55,197 INFO L225 Difference]: With dead ends: 463 [2019-10-14 23:45:55,197 INFO L226 Difference]: Without dead ends: 256 [2019-10-14 23:45:55,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-14 23:45:55,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 225. [2019-10-14 23:45:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-14 23:45:55,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 331 transitions. [2019-10-14 23:45:55,228 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 331 transitions. Word has length 30 [2019-10-14 23:45:55,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:55,228 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 331 transitions. [2019-10-14 23:45:55,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:55,229 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 331 transitions. [2019-10-14 23:45:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 23:45:55,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:55,230 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:55,230 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:55,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash 279611359, now seen corresponding path program 1 times [2019-10-14 23:45:55,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:55,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638174683] [2019-10-14 23:45:55,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:55,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:55,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:55,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:55,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638174683] [2019-10-14 23:45:55,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:55,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:45:55,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409395978] [2019-10-14 23:45:55,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:45:55,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:55,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:45:55,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:55,399 INFO L87 Difference]: Start difference. First operand 225 states and 331 transitions. Second operand 6 states. [2019-10-14 23:45:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:56,913 INFO L93 Difference]: Finished difference Result 440 states and 653 transitions. [2019-10-14 23:45:56,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:45:56,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-10-14 23:45:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:56,916 INFO L225 Difference]: With dead ends: 440 [2019-10-14 23:45:56,916 INFO L226 Difference]: Without dead ends: 237 [2019-10-14 23:45:56,918 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:45:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-14 23:45:56,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 229. [2019-10-14 23:45:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-14 23:45:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 335 transitions. [2019-10-14 23:45:56,943 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 335 transitions. Word has length 38 [2019-10-14 23:45:56,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:56,944 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 335 transitions. [2019-10-14 23:45:56,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:45:56,944 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 335 transitions. [2019-10-14 23:45:56,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-14 23:45:56,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:56,946 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] [2019-10-14 23:45:56,946 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:56,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:56,946 INFO L82 PathProgramCache]: Analyzing trace with hash -955467248, now seen corresponding path program 1 times [2019-10-14 23:45:56,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:56,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032156624] [2019-10-14 23:45:56,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:56,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:56,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:57,143 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:45:57,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032156624] [2019-10-14 23:45:57,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:57,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:57,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102684374] [2019-10-14 23:45:57,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:57,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:57,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:57,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:57,147 INFO L87 Difference]: Start difference. First operand 229 states and 335 transitions. Second operand 5 states. [2019-10-14 23:45:58,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:58,270 INFO L93 Difference]: Finished difference Result 401 states and 592 transitions. [2019-10-14 23:45:58,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:58,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-14 23:45:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:58,274 INFO L225 Difference]: With dead ends: 401 [2019-10-14 23:45:58,274 INFO L226 Difference]: Without dead ends: 229 [2019-10-14 23:45:58,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:58,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-14 23:45:58,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2019-10-14 23:45:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-14 23:45:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 326 transitions. [2019-10-14 23:45:58,297 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 326 transitions. Word has length 39 [2019-10-14 23:45:58,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:58,297 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 326 transitions. [2019-10-14 23:45:58,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 326 transitions. [2019-10-14 23:45:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-14 23:45:58,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:58,298 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:58,299 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:58,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:58,299 INFO L82 PathProgramCache]: Analyzing trace with hash -13889788, now seen corresponding path program 1 times [2019-10-14 23:45:58,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:58,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576460887] [2019-10-14 23:45:58,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:58,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:58,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:45:58,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576460887] [2019-10-14 23:45:58,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:58,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:58,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415646593] [2019-10-14 23:45:58,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:58,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:58,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:58,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:58,434 INFO L87 Difference]: Start difference. First operand 225 states and 326 transitions. Second operand 5 states. [2019-10-14 23:45:59,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:59,759 INFO L93 Difference]: Finished difference Result 450 states and 662 transitions. [2019-10-14 23:45:59,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:45:59,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-14 23:45:59,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:59,764 INFO L225 Difference]: With dead ends: 450 [2019-10-14 23:45:59,764 INFO L226 Difference]: Without dead ends: 248 [2019-10-14 23:45:59,766 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:45:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-14 23:45:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 241. [2019-10-14 23:45:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-10-14 23:45:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 345 transitions. [2019-10-14 23:45:59,799 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 345 transitions. Word has length 41 [2019-10-14 23:45:59,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:59,799 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 345 transitions. [2019-10-14 23:45:59,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 345 transitions. [2019-10-14 23:45:59,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-14 23:45:59,800 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:59,801 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:45:59,801 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:59,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:59,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1194739861, now seen corresponding path program 1 times [2019-10-14 23:45:59,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:59,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588476839] [2019-10-14 23:45:59,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:59,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:59,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:45:59,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588476839] [2019-10-14 23:45:59,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:59,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:59,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547744514] [2019-10-14 23:45:59,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:59,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:59,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:59,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:59,962 INFO L87 Difference]: Start difference. First operand 241 states and 345 transitions. Second operand 5 states. [2019-10-14 23:46:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:01,341 INFO L93 Difference]: Finished difference Result 470 states and 690 transitions. [2019-10-14 23:46:01,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:46:01,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-14 23:46:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:01,345 INFO L225 Difference]: With dead ends: 470 [2019-10-14 23:46:01,346 INFO L226 Difference]: Without dead ends: 254 [2019-10-14 23:46:01,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:46:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-14 23:46:01,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2019-10-14 23:46:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-14 23:46:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 353 transitions. [2019-10-14 23:46:01,368 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 353 transitions. Word has length 41 [2019-10-14 23:46:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:01,369 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 353 transitions. [2019-10-14 23:46:01,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:46:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 353 transitions. [2019-10-14 23:46:01,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-14 23:46:01,370 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:01,370 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:46:01,370 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:01,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:01,371 INFO L82 PathProgramCache]: Analyzing trace with hash -291623798, now seen corresponding path program 1 times [2019-10-14 23:46:01,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:01,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957165883] [2019-10-14 23:46:01,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:01,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:01,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-14 23:46:01,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957165883] [2019-10-14 23:46:01,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:46:01,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:46:01,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191922957] [2019-10-14 23:46:01,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:46:01,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:01,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:46:01,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:46:01,534 INFO L87 Difference]: Start difference. First operand 248 states and 353 transitions. Second operand 6 states. [2019-10-14 23:46:02,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:02,990 INFO L93 Difference]: Finished difference Result 469 states and 677 transitions. [2019-10-14 23:46:02,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:46:02,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-14 23:46:02,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:02,993 INFO L225 Difference]: With dead ends: 469 [2019-10-14 23:46:02,994 INFO L226 Difference]: Without dead ends: 254 [2019-10-14 23:46:02,995 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:46:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-14 23:46:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2019-10-14 23:46:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-14 23:46:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 352 transitions. [2019-10-14 23:46:03,020 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 352 transitions. Word has length 59 [2019-10-14 23:46:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:03,023 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 352 transitions. [2019-10-14 23:46:03,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:46:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 352 transitions. [2019-10-14 23:46:03,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-14 23:46:03,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:03,024 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:46:03,027 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:03,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:03,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1361992071, now seen corresponding path program 1 times [2019-10-14 23:46:03,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:03,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558706185] [2019-10-14 23:46:03,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:03,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:03,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-14 23:46:03,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558706185] [2019-10-14 23:46:03,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:46:03,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:46:03,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237071248] [2019-10-14 23:46:03,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:46:03,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:03,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:46:03,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:46:03,229 INFO L87 Difference]: Start difference. First operand 248 states and 352 transitions. Second operand 5 states. [2019-10-14 23:46:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:04,576 INFO L93 Difference]: Finished difference Result 483 states and 699 transitions. [2019-10-14 23:46:04,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:46:04,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-14 23:46:04,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:04,580 INFO L225 Difference]: With dead ends: 483 [2019-10-14 23:46:04,580 INFO L226 Difference]: Without dead ends: 273 [2019-10-14 23:46:04,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:46:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-14 23:46:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 266. [2019-10-14 23:46:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-14 23:46:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 373 transitions. [2019-10-14 23:46:04,614 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 373 transitions. Word has length 62 [2019-10-14 23:46:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:04,615 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 373 transitions. [2019-10-14 23:46:04,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:46:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 373 transitions. [2019-10-14 23:46:04,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-14 23:46:04,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:04,616 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:46:04,616 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:04,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:04,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1503019715, now seen corresponding path program 1 times [2019-10-14 23:46:04,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:04,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398663519] [2019-10-14 23:46:04,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:04,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:04,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-14 23:46:04,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398663519] [2019-10-14 23:46:04,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:46:04,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:46:04,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235209707] [2019-10-14 23:46:04,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:46:04,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:04,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:46:04,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:46:04,786 INFO L87 Difference]: Start difference. First operand 266 states and 373 transitions. Second operand 5 states. [2019-10-14 23:46:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:05,933 INFO L93 Difference]: Finished difference Result 490 states and 703 transitions. [2019-10-14 23:46:05,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:46:05,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-10-14 23:46:05,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:05,937 INFO L225 Difference]: With dead ends: 490 [2019-10-14 23:46:05,937 INFO L226 Difference]: Without dead ends: 264 [2019-10-14 23:46:05,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:46:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-14 23:46:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2019-10-14 23:46:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-14 23:46:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 359 transitions. [2019-10-14 23:46:05,976 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 359 transitions. Word has length 63 [2019-10-14 23:46:05,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:05,976 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 359 transitions. [2019-10-14 23:46:05,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:46:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 359 transitions. [2019-10-14 23:46:05,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-14 23:46:05,977 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:05,978 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:46:05,978 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:05,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:05,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1498693946, now seen corresponding path program 1 times [2019-10-14 23:46:05,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:05,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396159932] [2019-10-14 23:46:05,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:05,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:05,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-14 23:46:06,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396159932] [2019-10-14 23:46:06,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:46:06,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:46:06,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100177967] [2019-10-14 23:46:06,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:46:06,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:06,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:46:06,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:46:06,154 INFO L87 Difference]: Start difference. First operand 260 states and 359 transitions. Second operand 6 states. [2019-10-14 23:46:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:07,672 INFO L93 Difference]: Finished difference Result 477 states and 670 transitions. [2019-10-14 23:46:07,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:46:07,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-14 23:46:07,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:07,677 INFO L225 Difference]: With dead ends: 477 [2019-10-14 23:46:07,677 INFO L226 Difference]: Without dead ends: 266 [2019-10-14 23:46:07,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:46:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-10-14 23:46:07,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2019-10-14 23:46:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-14 23:46:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 358 transitions. [2019-10-14 23:46:07,699 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 358 transitions. Word has length 82 [2019-10-14 23:46:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:07,700 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 358 transitions. [2019-10-14 23:46:07,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:46:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 358 transitions. [2019-10-14 23:46:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-14 23:46:07,701 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:07,701 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:46:07,702 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:07,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:07,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1251929143, now seen corresponding path program 1 times [2019-10-14 23:46:07,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:07,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926189559] [2019-10-14 23:46:07,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:07,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:07,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-14 23:46:07,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926189559] [2019-10-14 23:46:07,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:46:07,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:46:07,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759842263] [2019-10-14 23:46:07,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:46:07,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:07,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:46:07,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:46:07,877 INFO L87 Difference]: Start difference. First operand 260 states and 358 transitions. Second operand 5 states. [2019-10-14 23:46:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:09,063 INFO L93 Difference]: Finished difference Result 466 states and 668 transitions. [2019-10-14 23:46:09,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:46:09,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-10-14 23:46:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:09,067 INFO L225 Difference]: With dead ends: 466 [2019-10-14 23:46:09,067 INFO L226 Difference]: Without dead ends: 262 [2019-10-14 23:46:09,068 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:46:09,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-14 23:46:09,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2019-10-14 23:46:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-10-14 23:46:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 354 transitions. [2019-10-14 23:46:09,092 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 354 transitions. Word has length 85 [2019-10-14 23:46:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:09,101 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 354 transitions. [2019-10-14 23:46:09,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:46:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 354 transitions. [2019-10-14 23:46:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-14 23:46:09,106 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:09,107 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:46:09,109 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:09,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:09,110 INFO L82 PathProgramCache]: Analyzing trace with hash 599019244, now seen corresponding path program 1 times [2019-10-14 23:46:09,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:09,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567995427] [2019-10-14 23:46:09,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:09,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:09,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,341 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-14 23:46:09,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567995427] [2019-10-14 23:46:09,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557619452] [2019-10-14 23:46:09,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:09,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:46:09,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:46:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-14 23:46:09,563 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:46:09,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-10-14 23:46:09,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639784627] [2019-10-14 23:46:09,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:46:09,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:09,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:46:09,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:46:09,565 INFO L87 Difference]: Start difference. First operand 258 states and 354 transitions. Second operand 5 states. [2019-10-14 23:46:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:10,852 INFO L93 Difference]: Finished difference Result 596 states and 828 transitions. [2019-10-14 23:46:10,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:46:10,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-14 23:46:10,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:10,856 INFO L225 Difference]: With dead ends: 596 [2019-10-14 23:46:10,856 INFO L226 Difference]: Without dead ends: 355 [2019-10-14 23:46:10,857 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:46:10,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-10-14 23:46:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 303. [2019-10-14 23:46:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-10-14 23:46:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 414 transitions. [2019-10-14 23:46:10,886 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 414 transitions. Word has length 100 [2019-10-14 23:46:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:10,886 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 414 transitions. [2019-10-14 23:46:10,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:46:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 414 transitions. [2019-10-14 23:46:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-14 23:46:10,888 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:10,888 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:46:11,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:11,094 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:11,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:11,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1779021272, now seen corresponding path program 1 times [2019-10-14 23:46:11,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:11,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395282827] [2019-10-14 23:46:11,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:11,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:11,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-10-14 23:46:11,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395282827] [2019-10-14 23:46:11,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:46:11,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:46:11,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398075794] [2019-10-14 23:46:11,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:46:11,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:11,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:46:11,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:46:11,366 INFO L87 Difference]: Start difference. First operand 303 states and 414 transitions. Second operand 5 states. [2019-10-14 23:46:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:12,740 INFO L93 Difference]: Finished difference Result 479 states and 666 transitions. [2019-10-14 23:46:12,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:46:12,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-14 23:46:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:12,745 INFO L225 Difference]: With dead ends: 479 [2019-10-14 23:46:12,745 INFO L226 Difference]: Without dead ends: 296 [2019-10-14 23:46:12,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:46:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-14 23:46:12,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-10-14 23:46:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-14 23:46:12,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 396 transitions. [2019-10-14 23:46:12,770 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 396 transitions. Word has length 141 [2019-10-14 23:46:12,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:12,771 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 396 transitions. [2019-10-14 23:46:12,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:46:12,771 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 396 transitions. [2019-10-14 23:46:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-14 23:46:12,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:12,773 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:46:12,773 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:12,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:12,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1060309692, now seen corresponding path program 1 times [2019-10-14 23:46:12,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:12,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047868525] [2019-10-14 23:46:12,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:12,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:12,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-10-14 23:46:13,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047868525] [2019-10-14 23:46:13,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:46:13,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:46:13,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116850608] [2019-10-14 23:46:13,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:46:13,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:13,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:46:13,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:46:13,028 INFO L87 Difference]: Start difference. First operand 292 states and 396 transitions. Second operand 5 states. [2019-10-14 23:46:13,196 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-14 23:46:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:14,259 INFO L93 Difference]: Finished difference Result 468 states and 648 transitions. [2019-10-14 23:46:14,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:46:14,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-14 23:46:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:14,266 INFO L225 Difference]: With dead ends: 468 [2019-10-14 23:46:14,266 INFO L226 Difference]: Without dead ends: 284 [2019-10-14 23:46:14,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:46:14,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-10-14 23:46:14,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 280. [2019-10-14 23:46:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-14 23:46:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 377 transitions. [2019-10-14 23:46:14,293 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 377 transitions. Word has length 143 [2019-10-14 23:46:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:14,294 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 377 transitions. [2019-10-14 23:46:14,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:46:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 377 transitions. [2019-10-14 23:46:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-14 23:46:14,297 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:14,297 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:46:14,298 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:14,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:14,298 INFO L82 PathProgramCache]: Analyzing trace with hash 158839533, now seen corresponding path program 1 times [2019-10-14 23:46:14,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:14,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372982801] [2019-10-14 23:46:14,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:14,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:14,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,582 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-10-14 23:46:14,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372982801] [2019-10-14 23:46:14,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819170286] [2019-10-14 23:46:14,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:14,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:46:14,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:46:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 74 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-14 23:46:14,816 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:46:14,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-10-14 23:46:14,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255064882] [2019-10-14 23:46:14,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:46:14,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:14,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:46:14,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:46:14,818 INFO L87 Difference]: Start difference. First operand 280 states and 377 transitions. Second operand 6 states. [2019-10-14 23:46:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:16,080 INFO L93 Difference]: Finished difference Result 585 states and 795 transitions. [2019-10-14 23:46:16,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:46:16,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-14 23:46:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:16,084 INFO L225 Difference]: With dead ends: 585 [2019-10-14 23:46:16,084 INFO L226 Difference]: Without dead ends: 328 [2019-10-14 23:46:16,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:46:16,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-10-14 23:46:16,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 318. [2019-10-14 23:46:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-10-14 23:46:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 424 transitions. [2019-10-14 23:46:16,112 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 424 transitions. Word has length 144 [2019-10-14 23:46:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:16,113 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 424 transitions. [2019-10-14 23:46:16,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:46:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 424 transitions. [2019-10-14 23:46:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-14 23:46:16,115 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:16,116 INFO L380 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:16,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:16,329 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:16,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:16,329 INFO L82 PathProgramCache]: Analyzing trace with hash 978746992, now seen corresponding path program 2 times [2019-10-14 23:46:16,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:16,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096869175] [2019-10-14 23:46:16,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:16,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:16,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2019-10-14 23:46:16,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096869175] [2019-10-14 23:46:16,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:46:16,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:46:16,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840005761] [2019-10-14 23:46:16,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:46:16,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:16,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:46:16,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:46:16,728 INFO L87 Difference]: Start difference. First operand 318 states and 424 transitions. Second operand 6 states. [2019-10-14 23:46:18,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:18,223 INFO L93 Difference]: Finished difference Result 493 states and 675 transitions. [2019-10-14 23:46:18,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:46:18,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2019-10-14 23:46:18,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:18,228 INFO L225 Difference]: With dead ends: 493 [2019-10-14 23:46:18,228 INFO L226 Difference]: Without dead ends: 322 [2019-10-14 23:46:18,229 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:46:18,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-14 23:46:18,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 318. [2019-10-14 23:46:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-10-14 23:46:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 418 transitions. [2019-10-14 23:46:18,254 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 418 transitions. Word has length 183 [2019-10-14 23:46:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:18,255 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 418 transitions. [2019-10-14 23:46:18,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:46:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 418 transitions. [2019-10-14 23:46:18,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-14 23:46:18,258 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:18,258 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:18,258 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:18,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:18,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1851165220, now seen corresponding path program 2 times [2019-10-14 23:46:18,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:18,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605509162] [2019-10-14 23:46:18,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:18,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:18,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-10-14 23:46:18,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605509162] [2019-10-14 23:46:18,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638604737] [2019-10-14 23:46:18,533 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:18,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-14 23:46:18,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:46:18,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:46:18,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:46:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-10-14 23:46:18,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:46:18,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-14 23:46:18,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90435176] [2019-10-14 23:46:18,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:46:18,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:18,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:46:18,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:46:18,701 INFO L87 Difference]: Start difference. First operand 318 states and 418 transitions. Second operand 4 states. [2019-10-14 23:46:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:18,750 INFO L93 Difference]: Finished difference Result 488 states and 665 transitions. [2019-10-14 23:46:18,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:46:18,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-10-14 23:46:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:18,753 INFO L225 Difference]: With dead ends: 488 [2019-10-14 23:46:18,753 INFO L226 Difference]: Without dead ends: 324 [2019-10-14 23:46:18,754 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:46:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-14 23:46:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2019-10-14 23:46:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-10-14 23:46:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 421 transitions. [2019-10-14 23:46:18,780 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 421 transitions. Word has length 190 [2019-10-14 23:46:18,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:18,781 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 421 transitions. [2019-10-14 23:46:18,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:46:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 421 transitions. [2019-10-14 23:46:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-14 23:46:18,784 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:18,784 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:46:18,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:18,989 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:18,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:18,990 INFO L82 PathProgramCache]: Analyzing trace with hash -55995379, now seen corresponding path program 1 times [2019-10-14 23:46:18,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:18,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429256935] [2019-10-14 23:46:18,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:18,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:18,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 140 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-10-14 23:46:19,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429256935] [2019-10-14 23:46:19,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35484493] [2019-10-14 23:46:19,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:19,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:46:19,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:46:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-10-14 23:46:19,510 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:46:19,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 7 [2019-10-14 23:46:19,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768835391] [2019-10-14 23:46:19,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:46:19,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:19,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:46:19,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:46:19,515 INFO L87 Difference]: Start difference. First operand 322 states and 421 transitions. Second operand 7 states. [2019-10-14 23:46:19,675 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-10-14 23:46:21,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:21,389 INFO L93 Difference]: Finished difference Result 563 states and 758 transitions. [2019-10-14 23:46:21,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:46:21,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2019-10-14 23:46:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:21,393 INFO L225 Difference]: With dead ends: 563 [2019-10-14 23:46:21,393 INFO L226 Difference]: Without dead ends: 327 [2019-10-14 23:46:21,395 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:46:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-14 23:46:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 301. [2019-10-14 23:46:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-14 23:46:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 390 transitions. [2019-10-14 23:46:21,441 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 390 transitions. Word has length 202 [2019-10-14 23:46:21,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:21,442 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 390 transitions. [2019-10-14 23:46:21,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:46:21,442 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 390 transitions. [2019-10-14 23:46:21,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-14 23:46:21,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:21,449 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:46:21,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:21,664 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:21,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:21,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1204328224, now seen corresponding path program 1 times [2019-10-14 23:46:21,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:21,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701685875] [2019-10-14 23:46:21,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:21,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:21,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:21,891 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-14 23:46:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-10-14 23:46:22,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701685875] [2019-10-14 23:46:22,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471173337] [2019-10-14 23:46:22,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:22,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:46:22,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:46:22,568 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-10-14 23:46:22,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:46:22,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2019-10-14 23:46:22,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125522972] [2019-10-14 23:46:22,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:46:22,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:46:22,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:46:22,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:46:22,572 INFO L87 Difference]: Start difference. First operand 301 states and 390 transitions. Second operand 4 states. [2019-10-14 23:46:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:46:22,646 INFO L93 Difference]: Finished difference Result 476 states and 641 transitions. [2019-10-14 23:46:22,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:46:22,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-10-14 23:46:22,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:46:22,651 INFO L225 Difference]: With dead ends: 476 [2019-10-14 23:46:22,651 INFO L226 Difference]: Without dead ends: 308 [2019-10-14 23:46:22,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:46:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-14 23:46:22,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2019-10-14 23:46:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-10-14 23:46:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 394 transitions. [2019-10-14 23:46:22,690 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 394 transitions. Word has length 226 [2019-10-14 23:46:22,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:46:22,691 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 394 transitions. [2019-10-14 23:46:22,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:46:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 394 transitions. [2019-10-14 23:46:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-14 23:46:22,700 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:46:22,700 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:46:22,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:22,908 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:46:22,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:46:22,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1446004142, now seen corresponding path program 1 times [2019-10-14 23:46:22,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:46:22,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691098698] [2019-10-14 23:46:22,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:22,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:46:22,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:46:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,121 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-14 23:46:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2019-10-14 23:46:23,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691098698] [2019-10-14 23:46:23,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575220493] [2019-10-14 23:46:23,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:46:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:46:23,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:46:23,757 INFO L279 TraceCheckSpWp]: Computing forward predicates...