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/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:50:03,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:50:03,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:50:03,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:50:03,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:50:03,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:50:03,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:50:03,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:50:03,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:50:03,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:50:03,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:50:03,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:50:03,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:50:03,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:50:03,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:50:03,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:50:03,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:50:03,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:50:03,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:50:03,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:50:03,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:50:03,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:50:03,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:50:03,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:50:03,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:50:03,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:50:03,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:50:03,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:50:03,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:50:03,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:50:03,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:50:03,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:50:03,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:50:03,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:50:03,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:50:03,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:50:03,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:50:03,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:50:03,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:50:03,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:50:03,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:50:03,401 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:50:03,421 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:50:03,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:50:03,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:50:03,426 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:50:03,427 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:50:03,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:50:03,427 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:50:03,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:50:03,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:50:03,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:50:03,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:50:03,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:50:03,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:50:03,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:50:03,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:50:03,431 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:50:03,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:50:03,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:50:03,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:50:03,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:50:03,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:50:03,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:50:03,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:50:03,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:50:03,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:50:03,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:50:03,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:50:03,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:50:03,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:50:03,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:50:03,752 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:50:03,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:50:03,756 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:50:03,756 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:50:03,757 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2019-10-14 23:50:03,819 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac05d7a8/70438761b10e403e951c2fb2727dd341/FLAG9d10a06c2 [2019-10-14 23:50:04,357 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:50:04,358 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2019-10-14 23:50:04,373 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac05d7a8/70438761b10e403e951c2fb2727dd341/FLAG9d10a06c2 [2019-10-14 23:50:04,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac05d7a8/70438761b10e403e951c2fb2727dd341 [2019-10-14 23:50:04,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:50:04,730 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:50:04,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:04,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:50:04,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:50:04,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:04" (1/1) ... [2019-10-14 23:50:04,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e92a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:04, skipping insertion in model container [2019-10-14 23:50:04,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:04" (1/1) ... [2019-10-14 23:50:04,747 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:50:04,787 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:50:04,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:04,986 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:50:05,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:05,138 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:50:05,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:05 WrapperNode [2019-10-14 23:50:05,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:05,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:50:05,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:50:05,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:50:05,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:05" (1/1) ... [2019-10-14 23:50:05,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:05" (1/1) ... [2019-10-14 23:50:05,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:05" (1/1) ... [2019-10-14 23:50:05,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:05" (1/1) ... [2019-10-14 23:50:05,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:05" (1/1) ... [2019-10-14 23:50:05,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:05" (1/1) ... [2019-10-14 23:50:05,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:05" (1/1) ... [2019-10-14 23:50:05,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:50:05,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:50:05,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:50:05,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:50:05,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:05" (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:50:05,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:50:05,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:50:05,245 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-14 23:50:05,245 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-14 23:50:05,246 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-14 23:50:05,246 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-14 23:50:05,246 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-14 23:50:05,246 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-14 23:50:05,246 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-14 23:50:05,246 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-14 23:50:05,246 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-14 23:50:05,246 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-14 23:50:05,246 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-14 23:50:05,247 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-14 23:50:05,247 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-14 23:50:05,247 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-14 23:50:05,247 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-14 23:50:05,247 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-14 23:50:05,247 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-14 23:50:05,248 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-14 23:50:05,248 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:50:05,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:50:05,248 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-14 23:50:05,248 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-14 23:50:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-14 23:50:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-14 23:50:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:50:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-14 23:50:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-14 23:50:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-14 23:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-14 23:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-14 23:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-14 23:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-14 23:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-14 23:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-14 23:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-14 23:50:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-14 23:50:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-14 23:50:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-14 23:50:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-14 23:50:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:50:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:50:05,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:50:05,781 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:50:05,782 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-14 23:50:05,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:05 BoogieIcfgContainer [2019-10-14 23:50:05,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:50:05,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:50:05,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:50:05,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:50:05,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:50:04" (1/3) ... [2019-10-14 23:50:05,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e44e512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:05, skipping insertion in model container [2019-10-14 23:50:05,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:05" (2/3) ... [2019-10-14 23:50:05,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e44e512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:05, skipping insertion in model container [2019-10-14 23:50:05,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:05" (3/3) ... [2019-10-14 23:50:05,795 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2019-10-14 23:50:05,806 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:50:05,819 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:50:05,829 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:50:05,857 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:50:05,857 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:50:05,857 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:50:05,857 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:50:05,858 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:50:05,858 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:50:05,858 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:50:05,858 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:50:05,885 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2019-10-14 23:50:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-14 23:50:05,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:05,902 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:05,905 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:05,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:05,911 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2019-10-14 23:50:05,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:05,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491888408] [2019-10-14 23:50:05,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:06,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491888408] [2019-10-14 23:50:06,509 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:06,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:06,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992198789] [2019-10-14 23:50:06,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:06,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:06,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:06,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:06,533 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 9 states. [2019-10-14 23:50:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:08,793 INFO L93 Difference]: Finished difference Result 501 states and 755 transitions. [2019-10-14 23:50:08,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:08,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-10-14 23:50:08,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:08,814 INFO L225 Difference]: With dead ends: 501 [2019-10-14 23:50:08,814 INFO L226 Difference]: Without dead ends: 357 [2019-10-14 23:50:08,820 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:08,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-10-14 23:50:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 244. [2019-10-14 23:50:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-10-14 23:50:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 323 transitions. [2019-10-14 23:50:08,919 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 323 transitions. Word has length 77 [2019-10-14 23:50:08,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:08,919 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 323 transitions. [2019-10-14 23:50:08,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 323 transitions. [2019-10-14 23:50:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-14 23:50:08,924 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:08,924 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:08,924 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:08,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:08,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2125445556, now seen corresponding path program 1 times [2019-10-14 23:50:08,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:08,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112075945] [2019-10-14 23:50:08,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:08,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:08,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,163 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:50:09,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112075945] [2019-10-14 23:50:09,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:09,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:09,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332455062] [2019-10-14 23:50:09,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:09,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:09,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:09,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:09,170 INFO L87 Difference]: Start difference. First operand 244 states and 323 transitions. Second operand 10 states. [2019-10-14 23:50:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:10,297 INFO L93 Difference]: Finished difference Result 573 states and 802 transitions. [2019-10-14 23:50:10,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:10,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2019-10-14 23:50:10,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:10,302 INFO L225 Difference]: With dead ends: 573 [2019-10-14 23:50:10,302 INFO L226 Difference]: Without dead ends: 348 [2019-10-14 23:50:10,305 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:10,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-10-14 23:50:10,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 244. [2019-10-14 23:50:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-10-14 23:50:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 316 transitions. [2019-10-14 23:50:10,353 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 316 transitions. Word has length 77 [2019-10-14 23:50:10,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:10,356 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 316 transitions. [2019-10-14 23:50:10,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 316 transitions. [2019-10-14 23:50:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-14 23:50:10,360 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:10,361 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:10,362 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:10,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:10,363 INFO L82 PathProgramCache]: Analyzing trace with hash -676620532, now seen corresponding path program 1 times [2019-10-14 23:50:10,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:10,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571352472] [2019-10-14 23:50:10,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:10,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:10,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,597 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:50:10,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571352472] [2019-10-14 23:50:10,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:10,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:10,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820183850] [2019-10-14 23:50:10,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:10,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:10,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:10,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:10,600 INFO L87 Difference]: Start difference. First operand 244 states and 316 transitions. Second operand 10 states. [2019-10-14 23:50:12,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:12,104 INFO L93 Difference]: Finished difference Result 696 states and 1012 transitions. [2019-10-14 23:50:12,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:50:12,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2019-10-14 23:50:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:12,109 INFO L225 Difference]: With dead ends: 696 [2019-10-14 23:50:12,110 INFO L226 Difference]: Without dead ends: 471 [2019-10-14 23:50:12,112 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:50:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-10-14 23:50:12,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 296. [2019-10-14 23:50:12,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-10-14 23:50:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 369 transitions. [2019-10-14 23:50:12,158 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 369 transitions. Word has length 77 [2019-10-14 23:50:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:12,158 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 369 transitions. [2019-10-14 23:50:12,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 369 transitions. [2019-10-14 23:50:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-14 23:50:12,160 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:12,161 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:12,161 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:12,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:12,161 INFO L82 PathProgramCache]: Analyzing trace with hash 758526605, now seen corresponding path program 1 times [2019-10-14 23:50:12,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:12,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493278668] [2019-10-14 23:50:12,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:12,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:12,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,343 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:50:12,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493278668] [2019-10-14 23:50:12,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:12,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:12,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278723466] [2019-10-14 23:50:12,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:12,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:12,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:12,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:12,345 INFO L87 Difference]: Start difference. First operand 296 states and 369 transitions. Second operand 10 states. [2019-10-14 23:50:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:13,759 INFO L93 Difference]: Finished difference Result 718 states and 955 transitions. [2019-10-14 23:50:13,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:50:13,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2019-10-14 23:50:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:13,766 INFO L225 Difference]: With dead ends: 718 [2019-10-14 23:50:13,766 INFO L226 Difference]: Without dead ends: 442 [2019-10-14 23:50:13,768 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:50:13,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-10-14 23:50:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 316. [2019-10-14 23:50:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-10-14 23:50:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 389 transitions. [2019-10-14 23:50:13,820 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 389 transitions. Word has length 77 [2019-10-14 23:50:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:13,822 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 389 transitions. [2019-10-14 23:50:13,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 389 transitions. [2019-10-14 23:50:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-14 23:50:13,830 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:13,831 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:13,835 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:13,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:13,836 INFO L82 PathProgramCache]: Analyzing trace with hash -613280693, now seen corresponding path program 1 times [2019-10-14 23:50:13,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:13,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86504529] [2019-10-14 23:50:13,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:13,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:13,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,009 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:50:14,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86504529] [2019-10-14 23:50:14,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:14,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:14,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779130396] [2019-10-14 23:50:14,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:14,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:14,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:14,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:14,012 INFO L87 Difference]: Start difference. First operand 316 states and 389 transitions. Second operand 10 states. [2019-10-14 23:50:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:15,328 INFO L93 Difference]: Finished difference Result 748 states and 981 transitions. [2019-10-14 23:50:15,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:50:15,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2019-10-14 23:50:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:15,332 INFO L225 Difference]: With dead ends: 748 [2019-10-14 23:50:15,333 INFO L226 Difference]: Without dead ends: 452 [2019-10-14 23:50:15,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:15,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-10-14 23:50:15,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 326. [2019-10-14 23:50:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-10-14 23:50:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 397 transitions. [2019-10-14 23:50:15,365 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 397 transitions. Word has length 77 [2019-10-14 23:50:15,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:15,366 INFO L462 AbstractCegarLoop]: Abstraction has 326 states and 397 transitions. [2019-10-14 23:50:15,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 397 transitions. [2019-10-14 23:50:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-14 23:50:15,367 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:15,368 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:15,368 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:15,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:15,368 INFO L82 PathProgramCache]: Analyzing trace with hash 88319181, now seen corresponding path program 1 times [2019-10-14 23:50:15,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:15,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421047479] [2019-10-14 23:50:15,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:15,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:15,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,568 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:50:15,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421047479] [2019-10-14 23:50:15,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:15,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:15,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870839810] [2019-10-14 23:50:15,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:15,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:15,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:15,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:15,572 INFO L87 Difference]: Start difference. First operand 326 states and 397 transitions. Second operand 10 states. [2019-10-14 23:50:16,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:16,970 INFO L93 Difference]: Finished difference Result 894 states and 1170 transitions. [2019-10-14 23:50:16,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 23:50:16,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2019-10-14 23:50:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:16,976 INFO L225 Difference]: With dead ends: 894 [2019-10-14 23:50:16,976 INFO L226 Difference]: Without dead ends: 587 [2019-10-14 23:50:16,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-10-14 23:50:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-14 23:50:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 362. [2019-10-14 23:50:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-10-14 23:50:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 422 transitions. [2019-10-14 23:50:17,011 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 422 transitions. Word has length 77 [2019-10-14 23:50:17,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:17,011 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 422 transitions. [2019-10-14 23:50:17,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:17,012 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 422 transitions. [2019-10-14 23:50:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-14 23:50:17,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:17,013 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:17,013 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:17,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:17,013 INFO L82 PathProgramCache]: Analyzing trace with hash 228867791, now seen corresponding path program 1 times [2019-10-14 23:50:17,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:17,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348818451] [2019-10-14 23:50:17,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:17,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:17,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:17,131 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:50:17,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348818451] [2019-10-14 23:50:17,132 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:17,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:50:17,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228601159] [2019-10-14 23:50:17,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:50:17,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:17,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:50:17,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:17,136 INFO L87 Difference]: Start difference. First operand 362 states and 422 transitions. Second operand 7 states. [2019-10-14 23:50:18,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:18,480 INFO L93 Difference]: Finished difference Result 1180 states and 1487 transitions. [2019-10-14 23:50:18,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:50:18,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-10-14 23:50:18,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:18,489 INFO L225 Difference]: With dead ends: 1180 [2019-10-14 23:50:18,489 INFO L226 Difference]: Without dead ends: 838 [2019-10-14 23:50:18,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:50:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-10-14 23:50:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 736. [2019-10-14 23:50:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-10-14 23:50:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 896 transitions. [2019-10-14 23:50:18,585 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 896 transitions. Word has length 77 [2019-10-14 23:50:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:18,587 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 896 transitions. [2019-10-14 23:50:18,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:50:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 896 transitions. [2019-10-14 23:50:18,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-14 23:50:18,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:18,591 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:18,591 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:18,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:18,592 INFO L82 PathProgramCache]: Analyzing trace with hash -208124888, now seen corresponding path program 1 times [2019-10-14 23:50:18,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:18,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584064718] [2019-10-14 23:50:18,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:18,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:18,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-14 23:50:18,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584064718] [2019-10-14 23:50:18,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638281152] [2019-10-14 23:50:18,874 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:50:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:19,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-14 23:50:19,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:19,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-10-14 23:50:19,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705314886] [2019-10-14 23:50:19,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:19,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:19,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:19,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:19,131 INFO L87 Difference]: Start difference. First operand 736 states and 896 transitions. Second operand 3 states. [2019-10-14 23:50:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:19,239 INFO L93 Difference]: Finished difference Result 1991 states and 2522 transitions. [2019-10-14 23:50:19,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:19,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-10-14 23:50:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:19,248 INFO L225 Difference]: With dead ends: 1991 [2019-10-14 23:50:19,248 INFO L226 Difference]: Without dead ends: 1276 [2019-10-14 23:50:19,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2019-10-14 23:50:19,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1273. [2019-10-14 23:50:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1273 states. [2019-10-14 23:50:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1595 transitions. [2019-10-14 23:50:19,365 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1595 transitions. Word has length 121 [2019-10-14 23:50:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:19,365 INFO L462 AbstractCegarLoop]: Abstraction has 1273 states and 1595 transitions. [2019-10-14 23:50:19,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1595 transitions. [2019-10-14 23:50:19,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-14 23:50:19,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:19,370 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:19,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:19,584 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:19,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:19,584 INFO L82 PathProgramCache]: Analyzing trace with hash -232182619, now seen corresponding path program 1 times [2019-10-14 23:50:19,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:19,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957292673] [2019-10-14 23:50:19,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:19,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:19,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-14 23:50:19,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957292673] [2019-10-14 23:50:19,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154311148] [2019-10-14 23:50:19,810 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:50:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:19,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:19,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-14 23:50:19,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:19,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2019-10-14 23:50:19,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646924360] [2019-10-14 23:50:19,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:19,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:19,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:19,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:19,940 INFO L87 Difference]: Start difference. First operand 1273 states and 1595 transitions. Second operand 3 states. [2019-10-14 23:50:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:20,114 INFO L93 Difference]: Finished difference Result 3443 states and 4567 transitions. [2019-10-14 23:50:20,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:20,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-14 23:50:20,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:20,130 INFO L225 Difference]: With dead ends: 3443 [2019-10-14 23:50:20,131 INFO L226 Difference]: Without dead ends: 2196 [2019-10-14 23:50:20,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:20,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2019-10-14 23:50:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2196. [2019-10-14 23:50:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2019-10-14 23:50:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 2827 transitions. [2019-10-14 23:50:20,398 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 2827 transitions. Word has length 139 [2019-10-14 23:50:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:20,399 INFO L462 AbstractCegarLoop]: Abstraction has 2196 states and 2827 transitions. [2019-10-14 23:50:20,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2827 transitions. [2019-10-14 23:50:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-14 23:50:20,407 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:20,407 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:20,612 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:20,613 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:20,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:20,614 INFO L82 PathProgramCache]: Analyzing trace with hash 2101755371, now seen corresponding path program 1 times [2019-10-14 23:50:20,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:20,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9759652] [2019-10-14 23:50:20,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:20,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:20,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-14 23:50:20,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9759652] [2019-10-14 23:50:20,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:20,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:20,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706991099] [2019-10-14 23:50:20,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:20,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:20,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:20,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:20,892 INFO L87 Difference]: Start difference. First operand 2196 states and 2827 transitions. Second operand 10 states. [2019-10-14 23:50:22,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:22,244 INFO L93 Difference]: Finished difference Result 4577 states and 5976 transitions. [2019-10-14 23:50:22,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:50:22,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-14 23:50:22,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:22,262 INFO L225 Difference]: With dead ends: 4577 [2019-10-14 23:50:22,263 INFO L226 Difference]: Without dead ends: 2407 [2019-10-14 23:50:22,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:50:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2019-10-14 23:50:22,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 2283. [2019-10-14 23:50:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2283 states. [2019-10-14 23:50:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 2956 transitions. [2019-10-14 23:50:22,521 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 2956 transitions. Word has length 140 [2019-10-14 23:50:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:22,521 INFO L462 AbstractCegarLoop]: Abstraction has 2283 states and 2956 transitions. [2019-10-14 23:50:22,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 2956 transitions. [2019-10-14 23:50:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-14 23:50:22,524 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:22,524 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:22,524 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:22,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:22,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1243208740, now seen corresponding path program 1 times [2019-10-14 23:50:22,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:22,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526061355] [2019-10-14 23:50:22,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:22,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:22,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-14 23:50:22,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526061355] [2019-10-14 23:50:22,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:22,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:22,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687393835] [2019-10-14 23:50:22,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:22,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:22,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:22,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:22,707 INFO L87 Difference]: Start difference. First operand 2283 states and 2956 transitions. Second operand 9 states. [2019-10-14 23:50:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:23,970 INFO L93 Difference]: Finished difference Result 4664 states and 6105 transitions. [2019-10-14 23:50:23,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:50:23,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-10-14 23:50:23,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:23,985 INFO L225 Difference]: With dead ends: 4664 [2019-10-14 23:50:23,985 INFO L226 Difference]: Without dead ends: 2402 [2019-10-14 23:50:23,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:50:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2019-10-14 23:50:24,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 2278. [2019-10-14 23:50:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2278 states. [2019-10-14 23:50:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 2947 transitions. [2019-10-14 23:50:24,217 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 2947 transitions. Word has length 121 [2019-10-14 23:50:24,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:24,218 INFO L462 AbstractCegarLoop]: Abstraction has 2278 states and 2947 transitions. [2019-10-14 23:50:24,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 2947 transitions. [2019-10-14 23:50:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-14 23:50:24,222 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:24,222 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:24,223 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:24,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:24,223 INFO L82 PathProgramCache]: Analyzing trace with hash 320702631, now seen corresponding path program 1 times [2019-10-14 23:50:24,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:24,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782897597] [2019-10-14 23:50:24,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:24,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:24,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-14 23:50:24,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782897597] [2019-10-14 23:50:24,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839274927] [2019-10-14 23:50:24,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:50:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:24,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:50:24,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-14 23:50:24,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:24,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-10-14 23:50:24,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637562607] [2019-10-14 23:50:24,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:24,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:24,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:24,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:24,664 INFO L87 Difference]: Start difference. First operand 2278 states and 2947 transitions. Second operand 3 states. [2019-10-14 23:50:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:24,875 INFO L93 Difference]: Finished difference Result 4535 states and 5973 transitions. [2019-10-14 23:50:24,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:24,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-14 23:50:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:24,887 INFO L225 Difference]: With dead ends: 4535 [2019-10-14 23:50:24,887 INFO L226 Difference]: Without dead ends: 1810 [2019-10-14 23:50:24,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:24,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2019-10-14 23:50:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2019-10-14 23:50:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1810 states. [2019-10-14 23:50:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2229 transitions. [2019-10-14 23:50:25,046 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2229 transitions. Word has length 122 [2019-10-14 23:50:25,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:25,047 INFO L462 AbstractCegarLoop]: Abstraction has 1810 states and 2229 transitions. [2019-10-14 23:50:25,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:25,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2229 transitions. [2019-10-14 23:50:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-14 23:50:25,050 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:25,050 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:25,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:25,263 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:25,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:25,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1360925018, now seen corresponding path program 1 times [2019-10-14 23:50:25,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:25,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909360577] [2019-10-14 23:50:25,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:25,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:25,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-14 23:50:25,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909360577] [2019-10-14 23:50:25,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554277831] [2019-10-14 23:50:25,489 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:50:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:25,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-14 23:50:25,626 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:25,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2019-10-14 23:50:25,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793911453] [2019-10-14 23:50:25,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:25,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:25,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:25,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:25,628 INFO L87 Difference]: Start difference. First operand 1810 states and 2229 transitions. Second operand 3 states. [2019-10-14 23:50:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:25,798 INFO L93 Difference]: Finished difference Result 4010 states and 5222 transitions. [2019-10-14 23:50:25,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:25,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-14 23:50:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:25,813 INFO L225 Difference]: With dead ends: 4010 [2019-10-14 23:50:25,813 INFO L226 Difference]: Without dead ends: 2221 [2019-10-14 23:50:25,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:25,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2019-10-14 23:50:26,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 2215. [2019-10-14 23:50:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2215 states. [2019-10-14 23:50:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 2686 transitions. [2019-10-14 23:50:26,041 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 2686 transitions. Word has length 156 [2019-10-14 23:50:26,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:26,042 INFO L462 AbstractCegarLoop]: Abstraction has 2215 states and 2686 transitions. [2019-10-14 23:50:26,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 2686 transitions. [2019-10-14 23:50:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-14 23:50:26,047 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:26,047 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:26,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:26,251 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:26,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:26,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1278730684, now seen corresponding path program 1 times [2019-10-14 23:50:26,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:26,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245930103] [2019-10-14 23:50:26,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:26,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:26,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-14 23:50:26,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245930103] [2019-10-14 23:50:26,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520315116] [2019-10-14 23:50:26,461 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:50:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-14 23:50:26,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-14 23:50:26,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:26,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-10-14 23:50:26,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420400662] [2019-10-14 23:50:26,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:26,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:26,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:26,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:50:26,674 INFO L87 Difference]: Start difference. First operand 2215 states and 2686 transitions. Second operand 3 states. [2019-10-14 23:50:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:26,886 INFO L93 Difference]: Finished difference Result 3922 states and 4748 transitions. [2019-10-14 23:50:26,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:26,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-14 23:50:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:26,903 INFO L225 Difference]: With dead ends: 3922 [2019-10-14 23:50:26,903 INFO L226 Difference]: Without dead ends: 2214 [2019-10-14 23:50:26,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:50:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2019-10-14 23:50:27,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2214. [2019-10-14 23:50:27,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2019-10-14 23:50:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 2639 transitions. [2019-10-14 23:50:27,164 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 2639 transitions. Word has length 157 [2019-10-14 23:50:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:27,165 INFO L462 AbstractCegarLoop]: Abstraction has 2214 states and 2639 transitions. [2019-10-14 23:50:27,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2639 transitions. [2019-10-14 23:50:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-14 23:50:27,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:27,170 INFO L380 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:27,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:27,382 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:27,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:27,383 INFO L82 PathProgramCache]: Analyzing trace with hash -797989467, now seen corresponding path program 1 times [2019-10-14 23:50:27,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:27,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769720269] [2019-10-14 23:50:27,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:27,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:27,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-14 23:50:27,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769720269] [2019-10-14 23:50:27,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037058556] [2019-10-14 23:50:27,652 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:50:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:50:27,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-14 23:50:27,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:27,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2019-10-14 23:50:27,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921053894] [2019-10-14 23:50:27,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:27,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:27,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:27,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:27,808 INFO L87 Difference]: Start difference. First operand 2214 states and 2639 transitions. Second operand 3 states. [2019-10-14 23:50:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:27,933 INFO L93 Difference]: Finished difference Result 3245 states and 3880 transitions. [2019-10-14 23:50:27,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:27,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-10-14 23:50:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:27,940 INFO L225 Difference]: With dead ends: 3245 [2019-10-14 23:50:27,940 INFO L226 Difference]: Without dead ends: 970 [2019-10-14 23:50:27,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 217 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-10-14 23:50:28,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2019-10-14 23:50:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-10-14 23:50:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1090 transitions. [2019-10-14 23:50:28,028 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1090 transitions. Word has length 176 [2019-10-14 23:50:28,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:28,029 INFO L462 AbstractCegarLoop]: Abstraction has 970 states and 1090 transitions. [2019-10-14 23:50:28,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1090 transitions. [2019-10-14 23:50:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-14 23:50:28,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:28,032 INFO L380 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:28,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:28,237 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:28,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:28,238 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2019-10-14 23:50:28,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:28,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807465844] [2019-10-14 23:50:28,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:28,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:28,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,592 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-14 23:50:28,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807465844] [2019-10-14 23:50:28,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628045899] [2019-10-14 23:50:28,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:28,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-14 23:50:28,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 52 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-14 23:50:28,798 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:28,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2019-10-14 23:50:28,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447571301] [2019-10-14 23:50:28,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:50:28,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:28,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:50:28,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:50:28,801 INFO L87 Difference]: Start difference. First operand 970 states and 1090 transitions. Second operand 12 states. [2019-10-14 23:50:31,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:31,221 INFO L93 Difference]: Finished difference Result 1204 states and 1382 transitions. [2019-10-14 23:50:31,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 23:50:31,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 176 [2019-10-14 23:50:31,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:31,223 INFO L225 Difference]: With dead ends: 1204 [2019-10-14 23:50:31,223 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:50:31,226 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2019-10-14 23:50:31,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:50:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:50:31,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:50:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:50:31,228 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2019-10-14 23:50:31,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:31,228 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:50:31,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:50:31,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:50:31,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:50:31,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:31,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:50:32,152 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2019-10-14 23:50:32,312 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2019-10-14 23:50:32,455 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2019-10-14 23:50:32,587 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2019-10-14 23:50:32,710 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103