/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:23:36,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:23:36,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:23:36,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:23:36,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:23:36,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:23:36,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:23:36,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:23:36,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:23:36,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:23:36,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:23:36,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:23:36,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:23:36,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:23:36,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:23:36,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:23:36,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:23:36,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:23:36,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:23:36,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:23:36,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:23:36,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:23:36,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:23:36,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:23:36,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:23:36,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:23:36,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:23:36,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:23:36,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:23:36,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:23:36,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:23:36,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:23:36,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:23:36,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:23:36,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:23:36,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:23:36,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:23:36,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:23:36,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:23:36,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:23:36,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:23:36,098 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 22:23:36,125 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:23:36,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:23:36,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:23:36,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:23:36,127 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:23:36,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:23:36,128 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:23:36,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:23:36,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:23:36,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:23:36,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:23:36,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:23:36,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:23:36,129 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:23:36,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:23:36,130 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:23:36,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:23:36,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:23:36,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:23:36,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:23:36,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:23:36,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:23:36,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:23:36,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:23:36,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:23:36,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:23:36,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:23:36,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:23:36,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:23:36,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:23:36,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:23:36,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:23:36,437 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:23:36,437 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:23:36,438 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2019-11-06 22:23:36,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed5dad61/5c4e6425f8ec40d793289f0601e5afe3/FLAGa584273b7 [2019-11-06 22:23:36,972 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:23:36,973 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2019-11-06 22:23:36,982 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed5dad61/5c4e6425f8ec40d793289f0601e5afe3/FLAGa584273b7 [2019-11-06 22:23:37,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed5dad61/5c4e6425f8ec40d793289f0601e5afe3 [2019-11-06 22:23:37,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:23:37,365 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:23:37,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:23:37,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:23:37,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:23:37,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:37" (1/1) ... [2019-11-06 22:23:37,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10cdd2b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:37, skipping insertion in model container [2019-11-06 22:23:37,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:37" (1/1) ... [2019-11-06 22:23:37,386 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:23:37,438 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:23:37,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:23:37,650 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:23:37,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:23:37,784 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:23:37,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:37 WrapperNode [2019-11-06 22:23:37,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:23:37,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:23:37,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:23:37,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:23:37,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:37" (1/1) ... [2019-11-06 22:23:37,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:37" (1/1) ... [2019-11-06 22:23:37,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:37" (1/1) ... [2019-11-06 22:23:37,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:37" (1/1) ... [2019-11-06 22:23:37,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:37" (1/1) ... [2019-11-06 22:23:37,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:37" (1/1) ... [2019-11-06 22:23:37,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:37" (1/1) ... [2019-11-06 22:23:37,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:23:37,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:23:37,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:23:37,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:23:37,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:23:37,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:23:37,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:23:37,894 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-11-06 22:23:37,894 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2019-11-06 22:23:37,894 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2019-11-06 22:23:37,894 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2019-11-06 22:23:37,894 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2019-11-06 22:23:37,895 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2019-11-06 22:23:37,895 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-11-06 22:23:37,895 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-11-06 22:23:37,895 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-11-06 22:23:37,895 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-11-06 22:23:37,896 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-11-06 22:23:37,896 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-11-06 22:23:37,897 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:23:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:23:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:23:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-11-06 22:23:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2019-11-06 22:23:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2019-11-06 22:23:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2019-11-06 22:23:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2019-11-06 22:23:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2019-11-06 22:23:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-11-06 22:23:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-11-06 22:23:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-11-06 22:23:37,899 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-11-06 22:23:37,899 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-11-06 22:23:37,899 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-11-06 22:23:37,899 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:23:37,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:23:37,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:23:38,351 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:23:38,352 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-06 22:23:38,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:38 BoogieIcfgContainer [2019-11-06 22:23:38,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:23:38,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:23:38,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:23:38,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:23:38,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:23:37" (1/3) ... [2019-11-06 22:23:38,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53727502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:38, skipping insertion in model container [2019-11-06 22:23:38,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:37" (2/3) ... [2019-11-06 22:23:38,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53727502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:38, skipping insertion in model container [2019-11-06 22:23:38,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:38" (3/3) ... [2019-11-06 22:23:38,361 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-11-06 22:23:38,371 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:23:38,379 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:23:38,388 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:23:38,415 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:23:38,415 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:23:38,415 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:23:38,415 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:23:38,415 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:23:38,416 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:23:38,416 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:23:38,416 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:23:38,438 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-06 22:23:38,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-06 22:23:38,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:38,450 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:38,452 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:38,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:38,458 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2019-11-06 22:23:38,466 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:38,466 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86446221] [2019-11-06 22:23:38,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:38,930 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86446221] [2019-11-06 22:23:38,931 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:38,931 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:23:38,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433205892] [2019-11-06 22:23:38,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:23:38,940 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:38,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:23:38,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:38,956 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 6 states. [2019-11-06 22:23:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:40,241 INFO L93 Difference]: Finished difference Result 356 states and 554 transitions. [2019-11-06 22:23:40,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:23:40,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-06 22:23:40,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:40,269 INFO L225 Difference]: With dead ends: 356 [2019-11-06 22:23:40,269 INFO L226 Difference]: Without dead ends: 248 [2019-11-06 22:23:40,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:23:40,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-06 22:23:40,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 185. [2019-11-06 22:23:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-06 22:23:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 246 transitions. [2019-11-06 22:23:40,370 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 246 transitions. Word has length 65 [2019-11-06 22:23:40,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:40,371 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 246 transitions. [2019-11-06 22:23:40,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:23:40,372 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 246 transitions. [2019-11-06 22:23:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-06 22:23:40,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:40,377 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:40,377 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:40,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:40,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1537976919, now seen corresponding path program 1 times [2019-11-06 22:23:40,378 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:40,378 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757775717] [2019-11-06 22:23:40,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:40,653 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757775717] [2019-11-06 22:23:40,653 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:40,653 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 22:23:40,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760591185] [2019-11-06 22:23:40,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:23:40,656 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:40,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:23:40,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:23:40,657 INFO L87 Difference]: Start difference. First operand 185 states and 246 transitions. Second operand 7 states. [2019-11-06 22:23:41,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:41,356 INFO L93 Difference]: Finished difference Result 406 states and 562 transitions. [2019-11-06 22:23:41,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:23:41,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-11-06 22:23:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:41,361 INFO L225 Difference]: With dead ends: 406 [2019-11-06 22:23:41,361 INFO L226 Difference]: Without dead ends: 238 [2019-11-06 22:23:41,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-06 22:23:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-11-06 22:23:41,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 182. [2019-11-06 22:23:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-06 22:23:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 241 transitions. [2019-11-06 22:23:41,407 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 241 transitions. Word has length 66 [2019-11-06 22:23:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:41,408 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 241 transitions. [2019-11-06 22:23:41,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 22:23:41,408 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 241 transitions. [2019-11-06 22:23:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-06 22:23:41,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:41,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:41,416 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:41,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:41,416 INFO L82 PathProgramCache]: Analyzing trace with hash -478173211, now seen corresponding path program 1 times [2019-11-06 22:23:41,417 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:41,417 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990567571] [2019-11-06 22:23:41,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:41,709 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990567571] [2019-11-06 22:23:41,709 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:41,709 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:23:41,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62968552] [2019-11-06 22:23:41,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:23:41,710 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:41,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:23:41,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:23:41,711 INFO L87 Difference]: Start difference. First operand 182 states and 241 transitions. Second operand 9 states. [2019-11-06 22:23:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:42,916 INFO L93 Difference]: Finished difference Result 582 states and 869 transitions. [2019-11-06 22:23:42,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 22:23:42,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-11-06 22:23:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:42,922 INFO L225 Difference]: With dead ends: 582 [2019-11-06 22:23:42,923 INFO L226 Difference]: Without dead ends: 417 [2019-11-06 22:23:42,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-06 22:23:42,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-11-06 22:23:43,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 336. [2019-11-06 22:23:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-06 22:23:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 490 transitions. [2019-11-06 22:23:43,014 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 490 transitions. Word has length 72 [2019-11-06 22:23:43,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:43,015 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 490 transitions. [2019-11-06 22:23:43,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 22:23:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 490 transitions. [2019-11-06 22:23:43,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-06 22:23:43,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:43,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:43,019 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:43,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:43,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2098500188, now seen corresponding path program 1 times [2019-11-06 22:23:43,020 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:43,020 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715852070] [2019-11-06 22:23:43,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:43,306 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715852070] [2019-11-06 22:23:43,307 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:43,307 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-06 22:23:43,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740833626] [2019-11-06 22:23:43,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 22:23:43,308 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:43,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 22:23:43,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-06 22:23:43,309 INFO L87 Difference]: Start difference. First operand 336 states and 490 transitions. Second operand 12 states. [2019-11-06 22:23:46,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:46,373 INFO L93 Difference]: Finished difference Result 873 states and 1358 transitions. [2019-11-06 22:23:46,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-06 22:23:46,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-11-06 22:23:46,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:46,378 INFO L225 Difference]: With dead ends: 873 [2019-11-06 22:23:46,378 INFO L226 Difference]: Without dead ends: 554 [2019-11-06 22:23:46,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2019-11-06 22:23:46,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-11-06 22:23:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 211. [2019-11-06 22:23:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-06 22:23:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2019-11-06 22:23:46,421 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 73 [2019-11-06 22:23:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:46,421 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2019-11-06 22:23:46,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 22:23:46,422 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2019-11-06 22:23:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-06 22:23:46,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:46,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:46,424 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:46,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:46,425 INFO L82 PathProgramCache]: Analyzing trace with hash -708931582, now seen corresponding path program 1 times [2019-11-06 22:23:46,425 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:46,425 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793758028] [2019-11-06 22:23:46,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:46,622 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793758028] [2019-11-06 22:23:46,622 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:46,622 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 22:23:46,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140687050] [2019-11-06 22:23:46,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 22:23:46,624 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:46,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 22:23:46,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:23:46,625 INFO L87 Difference]: Start difference. First operand 211 states and 276 transitions. Second operand 8 states. [2019-11-06 22:23:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:47,823 INFO L93 Difference]: Finished difference Result 612 states and 874 transitions. [2019-11-06 22:23:47,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 22:23:47,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-11-06 22:23:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:47,826 INFO L225 Difference]: With dead ends: 612 [2019-11-06 22:23:47,827 INFO L226 Difference]: Without dead ends: 418 [2019-11-06 22:23:47,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:23:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-06 22:23:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 323. [2019-11-06 22:23:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-06 22:23:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 419 transitions. [2019-11-06 22:23:47,869 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 419 transitions. Word has length 66 [2019-11-06 22:23:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:47,869 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 419 transitions. [2019-11-06 22:23:47,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 22:23:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 419 transitions. [2019-11-06 22:23:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-06 22:23:47,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:47,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:47,871 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:47,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:47,871 INFO L82 PathProgramCache]: Analyzing trace with hash -822318239, now seen corresponding path program 1 times [2019-11-06 22:23:47,871 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:47,872 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683073648] [2019-11-06 22:23:47,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:48,042 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683073648] [2019-11-06 22:23:48,042 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:48,042 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:23:48,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142167306] [2019-11-06 22:23:48,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:23:48,043 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:48,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:23:48,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:23:48,044 INFO L87 Difference]: Start difference. First operand 323 states and 419 transitions. Second operand 9 states. [2019-11-06 22:23:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:48,930 INFO L93 Difference]: Finished difference Result 727 states and 1002 transitions. [2019-11-06 22:23:48,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 22:23:48,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-06 22:23:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:48,934 INFO L225 Difference]: With dead ends: 727 [2019-11-06 22:23:48,935 INFO L226 Difference]: Without dead ends: 421 [2019-11-06 22:23:48,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:23:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-06 22:23:48,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 341. [2019-11-06 22:23:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-11-06 22:23:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 437 transitions. [2019-11-06 22:23:48,973 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 437 transitions. Word has length 66 [2019-11-06 22:23:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:48,973 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 437 transitions. [2019-11-06 22:23:48,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 22:23:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 437 transitions. [2019-11-06 22:23:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-06 22:23:48,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:48,976 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:48,976 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:48,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:48,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1843386593, now seen corresponding path program 1 times [2019-11-06 22:23:48,977 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:48,977 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422749223] [2019-11-06 22:23:48,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:49,182 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422749223] [2019-11-06 22:23:49,182 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:49,183 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:23:49,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928435439] [2019-11-06 22:23:49,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:23:49,185 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:49,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:23:49,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:23:49,186 INFO L87 Difference]: Start difference. First operand 341 states and 437 transitions. Second operand 9 states. [2019-11-06 22:23:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:52,008 INFO L93 Difference]: Finished difference Result 1164 states and 1617 transitions. [2019-11-06 22:23:52,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-06 22:23:52,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-06 22:23:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:52,016 INFO L225 Difference]: With dead ends: 1164 [2019-11-06 22:23:52,016 INFO L226 Difference]: Without dead ends: 840 [2019-11-06 22:23:52,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2019-11-06 22:23:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-11-06 22:23:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 643. [2019-11-06 22:23:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-06 22:23:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 815 transitions. [2019-11-06 22:23:52,091 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 815 transitions. Word has length 66 [2019-11-06 22:23:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:52,092 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 815 transitions. [2019-11-06 22:23:52,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 22:23:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 815 transitions. [2019-11-06 22:23:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-06 22:23:52,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:52,096 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:52,096 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:52,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:52,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1172255968, now seen corresponding path program 1 times [2019-11-06 22:23:52,097 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:52,097 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293101790] [2019-11-06 22:23:52,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:52,293 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293101790] [2019-11-06 22:23:52,293 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:52,294 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:23:52,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147391859] [2019-11-06 22:23:52,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:23:52,295 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:52,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:23:52,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:23:52,295 INFO L87 Difference]: Start difference. First operand 643 states and 815 transitions. Second operand 9 states. [2019-11-06 22:23:53,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:53,362 INFO L93 Difference]: Finished difference Result 1352 states and 1804 transitions. [2019-11-06 22:23:53,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 22:23:53,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-06 22:23:53,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:53,372 INFO L225 Difference]: With dead ends: 1352 [2019-11-06 22:23:53,376 INFO L226 Difference]: Without dead ends: 764 [2019-11-06 22:23:53,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-06 22:23:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-11-06 22:23:53,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 669. [2019-11-06 22:23:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-11-06 22:23:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 834 transitions. [2019-11-06 22:23:53,488 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 834 transitions. Word has length 66 [2019-11-06 22:23:53,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:53,489 INFO L462 AbstractCegarLoop]: Abstraction has 669 states and 834 transitions. [2019-11-06 22:23:53,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 22:23:53,489 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 834 transitions. [2019-11-06 22:23:53,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-06 22:23:53,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:53,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:53,492 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:53,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:53,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1347703966, now seen corresponding path program 1 times [2019-11-06 22:23:53,494 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:53,494 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126578207] [2019-11-06 22:23:53,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:53,748 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126578207] [2019-11-06 22:23:53,749 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:53,749 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 22:23:53,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924114674] [2019-11-06 22:23:53,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:23:53,752 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:53,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:23:53,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:23:53,754 INFO L87 Difference]: Start difference. First operand 669 states and 834 transitions. Second operand 7 states. [2019-11-06 22:23:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:54,601 INFO L93 Difference]: Finished difference Result 857 states and 1123 transitions. [2019-11-06 22:23:54,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 22:23:54,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-11-06 22:23:54,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:54,608 INFO L225 Difference]: With dead ends: 857 [2019-11-06 22:23:54,609 INFO L226 Difference]: Without dead ends: 854 [2019-11-06 22:23:54,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:23:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-11-06 22:23:54,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 745. [2019-11-06 22:23:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-06 22:23:54,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 951 transitions. [2019-11-06 22:23:54,698 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 951 transitions. Word has length 66 [2019-11-06 22:23:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:54,700 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 951 transitions. [2019-11-06 22:23:54,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 22:23:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 951 transitions. [2019-11-06 22:23:54,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-06 22:23:54,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:54,702 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:54,702 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:54,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1170545691, now seen corresponding path program 1 times [2019-11-06 22:23:54,703 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:54,703 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377748983] [2019-11-06 22:23:54,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:54,832 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377748983] [2019-11-06 22:23:54,832 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:54,832 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:23:54,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536113174] [2019-11-06 22:23:54,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:23:54,833 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:54,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:23:54,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:54,834 INFO L87 Difference]: Start difference. First operand 745 states and 951 transitions. Second operand 6 states. [2019-11-06 22:23:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:55,530 INFO L93 Difference]: Finished difference Result 1413 states and 1890 transitions. [2019-11-06 22:23:55,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:23:55,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-06 22:23:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:55,538 INFO L225 Difference]: With dead ends: 1413 [2019-11-06 22:23:55,538 INFO L226 Difference]: Without dead ends: 889 [2019-11-06 22:23:55,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:23:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2019-11-06 22:23:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 707. [2019-11-06 22:23:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-11-06 22:23:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 894 transitions. [2019-11-06 22:23:55,609 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 894 transitions. Word has length 67 [2019-11-06 22:23:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:55,610 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 894 transitions. [2019-11-06 22:23:55,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:23:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 894 transitions. [2019-11-06 22:23:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-06 22:23:55,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:55,612 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:55,612 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:55,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1338277302, now seen corresponding path program 1 times [2019-11-06 22:23:55,613 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:55,613 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011293810] [2019-11-06 22:23:55,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 22:23:55,784 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011293810] [2019-11-06 22:23:55,784 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606868562] [2019-11-06 22:23:55,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:23:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-06 22:23:55,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:23:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:55,981 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:23:55,981 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2019-11-06 22:23:55,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136453258] [2019-11-06 22:23:55,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:55,982 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:55,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:55,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:23:55,983 INFO L87 Difference]: Start difference. First operand 707 states and 894 transitions. Second operand 3 states. [2019-11-06 22:23:56,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:56,122 INFO L93 Difference]: Finished difference Result 1672 states and 2205 transitions. [2019-11-06 22:23:56,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:56,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-11-06 22:23:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:56,128 INFO L225 Difference]: With dead ends: 1672 [2019-11-06 22:23:56,129 INFO L226 Difference]: Without dead ends: 811 [2019-11-06 22:23:56,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:23:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-11-06 22:23:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2019-11-06 22:23:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-11-06 22:23:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1031 transitions. [2019-11-06 22:23:56,253 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1031 transitions. Word has length 87 [2019-11-06 22:23:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:56,253 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1031 transitions. [2019-11-06 22:23:56,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1031 transitions. [2019-11-06 22:23:56,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-06 22:23:56,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:56,260 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:56,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:23:56,466 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:56,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:56,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2019-11-06 22:23:56,467 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:56,467 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236320651] [2019-11-06 22:23:56,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-06 22:23:56,723 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236320651] [2019-11-06 22:23:56,723 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527176426] [2019-11-06 22:23:56,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:23:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:56,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-06 22:23:56,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:23:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:56,977 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:23:56,978 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-11-06 22:23:56,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151734694] [2019-11-06 22:23:56,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 22:23:56,979 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:56,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 22:23:56,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-11-06 22:23:56,980 INFO L87 Difference]: Start difference. First operand 811 states and 1031 transitions. Second operand 16 states. [2019-11-06 22:24:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:01,234 INFO L93 Difference]: Finished difference Result 2540 states and 3915 transitions. [2019-11-06 22:24:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-06 22:24:01,235 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 99 [2019-11-06 22:24:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:01,252 INFO L225 Difference]: With dead ends: 2540 [2019-11-06 22:24:01,253 INFO L226 Difference]: Without dead ends: 2537 [2019-11-06 22:24:01,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=306, Invalid=1674, Unknown=0, NotChecked=0, Total=1980 [2019-11-06 22:24:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2019-11-06 22:24:01,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2338. [2019-11-06 22:24:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2019-11-06 22:24:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 3577 transitions. [2019-11-06 22:24:01,598 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 3577 transitions. Word has length 99 [2019-11-06 22:24:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:01,599 INFO L462 AbstractCegarLoop]: Abstraction has 2338 states and 3577 transitions. [2019-11-06 22:24:01,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 22:24:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 3577 transitions. [2019-11-06 22:24:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-06 22:24:01,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:01,606 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:01,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:01,810 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:01,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:01,810 INFO L82 PathProgramCache]: Analyzing trace with hash 83738947, now seen corresponding path program 2 times [2019-11-06 22:24:01,810 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:01,811 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009950783] [2019-11-06 22:24:01,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-11-06 22:24:01,990 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009950783] [2019-11-06 22:24:01,991 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:01,991 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 22:24:01,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132465407] [2019-11-06 22:24:01,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:24:01,992 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:01,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:24:01,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:24:01,993 INFO L87 Difference]: Start difference. First operand 2338 states and 3577 transitions. Second operand 7 states. [2019-11-06 22:24:02,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:02,844 INFO L93 Difference]: Finished difference Result 3773 states and 6055 transitions. [2019-11-06 22:24:02,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:24:02,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2019-11-06 22:24:02,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:02,859 INFO L225 Difference]: With dead ends: 3773 [2019-11-06 22:24:02,859 INFO L226 Difference]: Without dead ends: 2107 [2019-11-06 22:24:02,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:02,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2019-11-06 22:24:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 2006. [2019-11-06 22:24:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2019-11-06 22:24:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2998 transitions. [2019-11-06 22:24:03,086 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2998 transitions. Word has length 125 [2019-11-06 22:24:03,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:03,087 INFO L462 AbstractCegarLoop]: Abstraction has 2006 states and 2998 transitions. [2019-11-06 22:24:03,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 22:24:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2998 transitions. [2019-11-06 22:24:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-06 22:24:03,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:03,092 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:03,092 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:03,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:03,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1218823465, now seen corresponding path program 1 times [2019-11-06 22:24:03,093 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:03,093 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068823577] [2019-11-06 22:24:03,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-06 22:24:03,322 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068823577] [2019-11-06 22:24:03,322 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218070760] [2019-11-06 22:24:03,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-06 22:24:03,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:24:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-06 22:24:03,552 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:24:03,552 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2019-11-06 22:24:03,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29411056] [2019-11-06 22:24:03,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:24:03,553 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:03,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:24:03,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-06 22:24:03,554 INFO L87 Difference]: Start difference. First operand 2006 states and 2998 transitions. Second operand 3 states. [2019-11-06 22:24:03,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:03,645 INFO L93 Difference]: Finished difference Result 2401 states and 3609 transitions. [2019-11-06 22:24:03,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:24:03,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-11-06 22:24:03,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:03,647 INFO L225 Difference]: With dead ends: 2401 [2019-11-06 22:24:03,647 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 22:24:03,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 169 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-06 22:24:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 22:24:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 22:24:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 22:24:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 22:24:03,660 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2019-11-06 22:24:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:03,661 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 22:24:03,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:24:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 22:24:03,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 22:24:03,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:03,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 22:24:10,061 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 1 [2019-11-06 22:24:10,857 WARN L191 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 92