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/transmitter.04.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:50:39,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:50:39,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:50:39,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:50:39,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:50:39,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:50:39,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:50:39,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:50:39,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:50:39,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:50:39,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:50:39,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:50:39,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:50:39,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:50:39,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:50:39,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:50:39,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:50:39,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:50:39,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:50:39,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:50:39,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:50:39,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:50:39,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:50:39,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:50:39,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:50:39,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:50:39,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:50:39,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:50:39,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:50:39,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:50:39,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:50:39,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:50:39,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:50:39,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:50:39,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:50:39,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:50:39,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:50:39,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:50:39,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:50:39,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:50:39,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:50:39,545 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:39,558 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:50:39,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:50:39,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:50:39,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:50:39,560 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:50:39,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:50:39,560 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:50:39,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:50:39,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:50:39,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:50:39,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:50:39,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:50:39,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:50:39,562 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:50:39,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:50:39,562 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:50:39,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:50:39,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:50:39,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:50:39,563 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:50:39,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:50:39,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:50:39,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:50:39,564 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:50:39,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:50:39,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:50:39,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:50:39,565 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:50:39,565 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:50:39,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:50:39,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:50:39,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:50:39,878 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:50:39,878 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:50:39,879 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.04.cil.c [2019-10-14 23:50:39,946 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08186ac1b/8e66dcee860d4b3aa5e2d9091d66f390/FLAG98606709d [2019-10-14 23:50:40,348 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:50:40,349 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.04.cil.c [2019-10-14 23:50:40,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08186ac1b/8e66dcee860d4b3aa5e2d9091d66f390/FLAG98606709d [2019-10-14 23:50:40,687 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08186ac1b/8e66dcee860d4b3aa5e2d9091d66f390 [2019-10-14 23:50:40,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:50:40,697 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:50:40,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:40,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:50:40,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:50:40,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:40" (1/1) ... [2019-10-14 23:50:40,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@255f04f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:40, skipping insertion in model container [2019-10-14 23:50:40,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:40" (1/1) ... [2019-10-14 23:50:40,714 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:50:40,775 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:50:41,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:41,103 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:50:41,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:41,268 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:50:41,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:41 WrapperNode [2019-10-14 23:50:41,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:41,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:50:41,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:50:41,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:50:41,285 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:41" (1/1) ... [2019-10-14 23:50:41,285 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:41" (1/1) ... [2019-10-14 23:50:41,309 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:41" (1/1) ... [2019-10-14 23:50:41,310 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:41" (1/1) ... [2019-10-14 23:50:41,334 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:41" (1/1) ... [2019-10-14 23:50:41,366 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:41" (1/1) ... [2019-10-14 23:50:41,372 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:41" (1/1) ... [2019-10-14 23:50:41,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:50:41,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:50:41,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:50:41,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:50:41,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:41" (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:41,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:50:41,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:50:41,451 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-14 23:50:41,452 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-14 23:50:41,452 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-14 23:50:41,453 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-14 23:50:41,453 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-14 23:50:41,453 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-10-14 23:50:41,454 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-14 23:50:41,454 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-14 23:50:41,455 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-14 23:50:41,455 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-14 23:50:41,456 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-10-14 23:50:41,456 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-14 23:50:41,457 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-14 23:50:41,458 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-14 23:50:41,460 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-14 23:50:41,461 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-14 23:50:41,461 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-14 23:50:41,461 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-14 23:50:41,461 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-14 23:50:41,461 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-14 23:50:41,461 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-14 23:50:41,462 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-14 23:50:41,462 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-14 23:50:41,462 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-14 23:50:41,462 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:50:41,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:50:41,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:50:41,463 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-14 23:50:41,463 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-14 23:50:41,463 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-14 23:50:41,463 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-14 23:50:41,463 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-14 23:50:41,464 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-10-14 23:50:41,464 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-14 23:50:41,464 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-14 23:50:41,464 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-14 23:50:41,464 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-14 23:50:41,464 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-14 23:50:41,465 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-10-14 23:50:41,465 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-14 23:50:41,465 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-14 23:50:41,465 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-14 23:50:41,466 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-14 23:50:41,466 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-14 23:50:41,466 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-14 23:50:41,466 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-14 23:50:41,466 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-14 23:50:41,466 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-14 23:50:41,466 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-14 23:50:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-14 23:50:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-14 23:50:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:50:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:50:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:50:42,229 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:50:42,230 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-14 23:50:42,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:42 BoogieIcfgContainer [2019-10-14 23:50:42,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:50:42,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:50:42,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:50:42,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:50:42,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:50:40" (1/3) ... [2019-10-14 23:50:42,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a497478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:42, skipping insertion in model container [2019-10-14 23:50:42,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:41" (2/3) ... [2019-10-14 23:50:42,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a497478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:42, skipping insertion in model container [2019-10-14 23:50:42,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:42" (3/3) ... [2019-10-14 23:50:42,240 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.04.cil.c [2019-10-14 23:50:42,251 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:50:42,260 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:50:42,273 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:50:42,302 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:50:42,302 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:50:42,303 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:50:42,303 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:50:42,304 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:50:42,305 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:50:42,305 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:50:42,305 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:50:42,341 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states. [2019-10-14 23:50:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-14 23:50:42,355 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:42,356 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:42,358 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:42,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:42,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1449217388, now seen corresponding path program 1 times [2019-10-14 23:50:42,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:42,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24719446] [2019-10-14 23:50:42,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:42,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:42,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:43,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24719446] [2019-10-14 23:50:43,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:43,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:43,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941113138] [2019-10-14 23:50:43,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:43,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:43,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:43,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:43,168 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 9 states. [2019-10-14 23:50:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:47,272 INFO L93 Difference]: Finished difference Result 863 states and 1387 transitions. [2019-10-14 23:50:47,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:47,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-10-14 23:50:47,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:47,296 INFO L225 Difference]: With dead ends: 863 [2019-10-14 23:50:47,297 INFO L226 Difference]: Without dead ends: 637 [2019-10-14 23:50:47,304 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-14 23:50:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 416. [2019-10-14 23:50:47,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-10-14 23:50:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 582 transitions. [2019-10-14 23:50:47,474 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 582 transitions. Word has length 120 [2019-10-14 23:50:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:47,474 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 582 transitions. [2019-10-14 23:50:47,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 582 transitions. [2019-10-14 23:50:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-14 23:50:47,487 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:47,488 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:47,488 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:47,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:47,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1789018706, now seen corresponding path program 1 times [2019-10-14 23:50:47,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:47,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845878671] [2019-10-14 23:50:47,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:47,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:47,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,909 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:47,910 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845878671] [2019-10-14 23:50:47,911 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:47,911 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:47,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091175514] [2019-10-14 23:50:47,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:47,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:47,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:47,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:47,918 INFO L87 Difference]: Start difference. First operand 416 states and 582 transitions. Second operand 10 states. [2019-10-14 23:50:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:50,146 INFO L93 Difference]: Finished difference Result 1022 states and 1494 transitions. [2019-10-14 23:50:50,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:50,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-14 23:50:50,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:50,154 INFO L225 Difference]: With dead ends: 1022 [2019-10-14 23:50:50,154 INFO L226 Difference]: Without dead ends: 628 [2019-10-14 23:50:50,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-10-14 23:50:50,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 416. [2019-10-14 23:50:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-10-14 23:50:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 575 transitions. [2019-10-14 23:50:50,257 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 575 transitions. Word has length 120 [2019-10-14 23:50:50,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:50,259 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 575 transitions. [2019-10-14 23:50:50,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:50,260 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 575 transitions. [2019-10-14 23:50:50,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-14 23:50:50,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:50,263 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,263 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:50,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:50,264 INFO L82 PathProgramCache]: Analyzing trace with hash 896420626, now seen corresponding path program 1 times [2019-10-14 23:50:50,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:50,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200518047] [2019-10-14 23:50:50,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:50,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:50,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,544 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:50,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200518047] [2019-10-14 23:50:50,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:50,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:50,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464605292] [2019-10-14 23:50:50,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:50,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:50,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:50,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:50,550 INFO L87 Difference]: Start difference. First operand 416 states and 575 transitions. Second operand 10 states. [2019-10-14 23:50:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:52,676 INFO L93 Difference]: Finished difference Result 1018 states and 1472 transitions. [2019-10-14 23:50:52,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:52,679 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-14 23:50:52,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:52,688 INFO L225 Difference]: With dead ends: 1018 [2019-10-14 23:50:52,688 INFO L226 Difference]: Without dead ends: 624 [2019-10-14 23:50:52,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-10-14 23:50:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 416. [2019-10-14 23:50:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-10-14 23:50:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 568 transitions. [2019-10-14 23:50:52,774 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 568 transitions. Word has length 120 [2019-10-14 23:50:52,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:52,775 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 568 transitions. [2019-10-14 23:50:52,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 568 transitions. [2019-10-14 23:50:52,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-14 23:50:52,778 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:52,779 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,779 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:52,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:52,780 INFO L82 PathProgramCache]: Analyzing trace with hash -794940846, now seen corresponding path program 1 times [2019-10-14 23:50:52,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:52,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227449492] [2019-10-14 23:50:52,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:52,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:52,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,099 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:53,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227449492] [2019-10-14 23:50:53,100 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:53,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:53,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915667852] [2019-10-14 23:50:53,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:53,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:53,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:53,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:53,102 INFO L87 Difference]: Start difference. First operand 416 states and 568 transitions. Second operand 10 states. [2019-10-14 23:50:55,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:55,032 INFO L93 Difference]: Finished difference Result 1014 states and 1450 transitions. [2019-10-14 23:50:55,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:55,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-14 23:50:55,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:55,037 INFO L225 Difference]: With dead ends: 1014 [2019-10-14 23:50:55,037 INFO L226 Difference]: Without dead ends: 620 [2019-10-14 23:50:55,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:55,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-14 23:50:55,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 416. [2019-10-14 23:50:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-10-14 23:50:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 561 transitions. [2019-10-14 23:50:55,110 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 561 transitions. Word has length 120 [2019-10-14 23:50:55,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:55,111 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 561 transitions. [2019-10-14 23:50:55,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 561 transitions. [2019-10-14 23:50:55,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-14 23:50:55,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:55,114 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:55,115 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:55,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:55,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1403690222, now seen corresponding path program 1 times [2019-10-14 23:50:55,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:55,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746656632] [2019-10-14 23:50:55,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:55,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:55,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,428 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:55,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746656632] [2019-10-14 23:50:55,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:55,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:55,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558882290] [2019-10-14 23:50:55,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:55,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:55,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:55,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:55,433 INFO L87 Difference]: Start difference. First operand 416 states and 561 transitions. Second operand 10 states. [2019-10-14 23:50:58,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:58,096 INFO L93 Difference]: Finished difference Result 1233 states and 1825 transitions. [2019-10-14 23:50:58,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:58,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-14 23:50:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:58,109 INFO L225 Difference]: With dead ends: 1233 [2019-10-14 23:50:58,110 INFO L226 Difference]: Without dead ends: 839 [2019-10-14 23:50:58,112 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:50:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-10-14 23:50:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 528. [2019-10-14 23:50:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-10-14 23:50:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 691 transitions. [2019-10-14 23:50:58,185 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 691 transitions. Word has length 120 [2019-10-14 23:50:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:58,186 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 691 transitions. [2019-10-14 23:50:58,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 691 transitions. [2019-10-14 23:50:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-14 23:50:58,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:58,188 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:58,188 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:58,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:58,189 INFO L82 PathProgramCache]: Analyzing trace with hash 973327314, now seen corresponding path program 1 times [2019-10-14 23:50:58,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:58,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554636422] [2019-10-14 23:50:58,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:58,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:58,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,441 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:58,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554636422] [2019-10-14 23:50:58,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:58,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:58,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257524855] [2019-10-14 23:50:58,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:58,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:58,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:58,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:58,445 INFO L87 Difference]: Start difference. First operand 528 states and 691 transitions. Second operand 10 states. [2019-10-14 23:51:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:01,463 INFO L93 Difference]: Finished difference Result 1489 states and 2131 transitions. [2019-10-14 23:51:01,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:51:01,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-14 23:51:01,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:01,470 INFO L225 Difference]: With dead ends: 1489 [2019-10-14 23:51:01,470 INFO L226 Difference]: Without dead ends: 983 [2019-10-14 23:51:01,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:51:01,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-10-14 23:51:01,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 640. [2019-10-14 23:51:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-10-14 23:51:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 817 transitions. [2019-10-14 23:51:01,550 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 817 transitions. Word has length 120 [2019-10-14 23:51:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:01,551 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 817 transitions. [2019-10-14 23:51:01,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:51:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 817 transitions. [2019-10-14 23:51:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-14 23:51:01,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:01,553 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:01,553 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:01,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:01,554 INFO L82 PathProgramCache]: Analyzing trace with hash 518555283, now seen corresponding path program 1 times [2019-10-14 23:51:01,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:01,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776426593] [2019-10-14 23:51:01,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:01,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:01,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:01,807 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:51:01,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776426593] [2019-10-14 23:51:01,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:01,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:51:01,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748935416] [2019-10-14 23:51:01,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:51:01,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:01,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:51:01,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:51:01,810 INFO L87 Difference]: Start difference. First operand 640 states and 817 transitions. Second operand 10 states. [2019-10-14 23:51:04,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:04,449 INFO L93 Difference]: Finished difference Result 1745 states and 2429 transitions. [2019-10-14 23:51:04,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:51:04,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-14 23:51:04,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:04,459 INFO L225 Difference]: With dead ends: 1745 [2019-10-14 23:51:04,459 INFO L226 Difference]: Without dead ends: 1127 [2019-10-14 23:51:04,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:51:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2019-10-14 23:51:04,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 752. [2019-10-14 23:51:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-10-14 23:51:04,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 939 transitions. [2019-10-14 23:51:04,543 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 939 transitions. Word has length 120 [2019-10-14 23:51:04,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:04,544 INFO L462 AbstractCegarLoop]: Abstraction has 752 states and 939 transitions. [2019-10-14 23:51:04,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:51:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 939 transitions. [2019-10-14 23:51:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-14 23:51:04,545 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:04,545 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:04,546 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:04,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:04,546 INFO L82 PathProgramCache]: Analyzing trace with hash -658850126, now seen corresponding path program 1 times [2019-10-14 23:51:04,546 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:04,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355557191] [2019-10-14 23:51:04,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:04,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:04,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,761 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:51:04,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355557191] [2019-10-14 23:51:04,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:04,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:51:04,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150859492] [2019-10-14 23:51:04,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:51:04,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:04,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:51:04,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:51:04,763 INFO L87 Difference]: Start difference. First operand 752 states and 939 transitions. Second operand 10 states. [2019-10-14 23:51:07,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:07,189 INFO L93 Difference]: Finished difference Result 1991 states and 2707 transitions. [2019-10-14 23:51:07,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:51:07,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-14 23:51:07,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:07,196 INFO L225 Difference]: With dead ends: 1991 [2019-10-14 23:51:07,197 INFO L226 Difference]: Without dead ends: 1261 [2019-10-14 23:51:07,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:51:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2019-10-14 23:51:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 858. [2019-10-14 23:51:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-10-14 23:51:07,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1051 transitions. [2019-10-14 23:51:07,311 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1051 transitions. Word has length 120 [2019-10-14 23:51:07,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:07,312 INFO L462 AbstractCegarLoop]: Abstraction has 858 states and 1051 transitions. [2019-10-14 23:51:07,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:51:07,312 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1051 transitions. [2019-10-14 23:51:07,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-14 23:51:07,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:07,315 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:07,316 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:07,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1767945777, now seen corresponding path program 1 times [2019-10-14 23:51:07,316 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:07,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877580086] [2019-10-14 23:51:07,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:07,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:07,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,551 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:51:07,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877580086] [2019-10-14 23:51:07,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:07,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:51:07,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937026668] [2019-10-14 23:51:07,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:51:07,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:07,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:51:07,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:51:07,557 INFO L87 Difference]: Start difference. First operand 858 states and 1051 transitions. Second operand 10 states. [2019-10-14 23:51:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:10,212 INFO L93 Difference]: Finished difference Result 2086 states and 2698 transitions. [2019-10-14 23:51:10,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:51:10,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-14 23:51:10,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:10,222 INFO L225 Difference]: With dead ends: 2086 [2019-10-14 23:51:10,223 INFO L226 Difference]: Without dead ends: 1251 [2019-10-14 23:51:10,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:51:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-10-14 23:51:10,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 883. [2019-10-14 23:51:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-10-14 23:51:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1071 transitions. [2019-10-14 23:51:10,317 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1071 transitions. Word has length 120 [2019-10-14 23:51:10,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:10,318 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1071 transitions. [2019-10-14 23:51:10,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:51:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1071 transitions. [2019-10-14 23:51:10,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-14 23:51:10,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:10,320 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:10,320 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:10,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:10,320 INFO L82 PathProgramCache]: Analyzing trace with hash -792917069, now seen corresponding path program 1 times [2019-10-14 23:51:10,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:10,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707879412] [2019-10-14 23:51:10,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:10,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:10,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:51:10,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707879412] [2019-10-14 23:51:10,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:10,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:51:10,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471285001] [2019-10-14 23:51:10,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:51:10,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:10,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:51:10,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:51:10,560 INFO L87 Difference]: Start difference. First operand 883 states and 1071 transitions. Second operand 10 states. [2019-10-14 23:51:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:13,405 INFO L93 Difference]: Finished difference Result 2075 states and 2647 transitions. [2019-10-14 23:51:13,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:51:13,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-14 23:51:13,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:13,412 INFO L225 Difference]: With dead ends: 2075 [2019-10-14 23:51:13,412 INFO L226 Difference]: Without dead ends: 1215 [2019-10-14 23:51:13,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:51:13,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-10-14 23:51:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 893. [2019-10-14 23:51:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-10-14 23:51:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1073 transitions. [2019-10-14 23:51:13,520 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1073 transitions. Word has length 120 [2019-10-14 23:51:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:13,521 INFO L462 AbstractCegarLoop]: Abstraction has 893 states and 1073 transitions. [2019-10-14 23:51:13,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:51:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1073 transitions. [2019-10-14 23:51:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-14 23:51:13,523 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:13,523 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:13,523 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:13,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1524884495, now seen corresponding path program 1 times [2019-10-14 23:51:13,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:13,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86277985] [2019-10-14 23:51:13,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:13,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:13,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:13,822 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:51:13,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86277985] [2019-10-14 23:51:13,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:13,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:51:13,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107407419] [2019-10-14 23:51:13,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:51:13,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:13,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:51:13,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:51:13,824 INFO L87 Difference]: Start difference. First operand 893 states and 1073 transitions. Second operand 10 states. [2019-10-14 23:51:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:17,064 INFO L93 Difference]: Finished difference Result 2082 states and 2625 transitions. [2019-10-14 23:51:17,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:51:17,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-14 23:51:17,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:17,069 INFO L225 Difference]: With dead ends: 2082 [2019-10-14 23:51:17,070 INFO L226 Difference]: Without dead ends: 1212 [2019-10-14 23:51:17,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:51:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-10-14 23:51:17,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 903. [2019-10-14 23:51:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-10-14 23:51:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1075 transitions. [2019-10-14 23:51:17,175 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1075 transitions. Word has length 120 [2019-10-14 23:51:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:17,175 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1075 transitions. [2019-10-14 23:51:17,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:51:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1075 transitions. [2019-10-14 23:51:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-14 23:51:17,177 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:17,177 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:17,177 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:17,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash -263967245, now seen corresponding path program 1 times [2019-10-14 23:51:17,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:17,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090323012] [2019-10-14 23:51:17,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:17,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:17,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:17,385 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:51:17,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090323012] [2019-10-14 23:51:17,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:17,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:51:17,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535791151] [2019-10-14 23:51:17,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:51:17,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:17,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:51:17,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:51:17,388 INFO L87 Difference]: Start difference. First operand 903 states and 1075 transitions. Second operand 10 states.