/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:07:26,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:07:26,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:07:26,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:07:26,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:07:26,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:07:26,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:07:26,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:07:26,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:07:26,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:07:26,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:07:26,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:07:26,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:07:26,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:07:26,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:07:26,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:07:26,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:07:26,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:07:26,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:07:26,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:07:26,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:07:26,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:07:26,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:07:26,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:07:26,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:07:26,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:07:26,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:07:26,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:07:26,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:07:26,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:07:26,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:07:26,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:07:26,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:07:26,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:07:26,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:07:26,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:07:26,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:07:26,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:07:26,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:07:26,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:07:26,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:07:26,107 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:07:26,121 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:07:26,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:07:26,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:07:26,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:07:26,123 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:07:26,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:07:26,124 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:07:26,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:07:26,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:07:26,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:07:26,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:07:26,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:07:26,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:07:26,125 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:07:26,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:07:26,125 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:07:26,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:07:26,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:07:26,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:07:26,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:07:26,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:07:26,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:07:26,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:07:26,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:07:26,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:07:26,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:07:26,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:07:26,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:07:26,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:07:26,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:07:26,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:07:26,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:07:26,435 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:07:26,435 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:07:26,436 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i [2019-12-27 03:07:26,508 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a86e0fb5/e11d3c1f023c411e8d73902589574f38/FLAG08b0a1a92 [2019-12-27 03:07:27,091 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:07:27,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i [2019-12-27 03:07:27,111 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a86e0fb5/e11d3c1f023c411e8d73902589574f38/FLAG08b0a1a92 [2019-12-27 03:07:27,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a86e0fb5/e11d3c1f023c411e8d73902589574f38 [2019-12-27 03:07:27,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:07:27,435 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:07:27,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:07:27,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:07:27,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:07:27,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:07:27" (1/1) ... [2019-12-27 03:07:27,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2421830e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:27, skipping insertion in model container [2019-12-27 03:07:27,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:07:27" (1/1) ... [2019-12-27 03:07:27,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:07:27,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:07:28,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:07:28,076 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:07:28,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:07:28,276 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:07:28,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:28 WrapperNode [2019-12-27 03:07:28,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:07:28,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:07:28,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:07:28,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:07:28,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:28" (1/1) ... [2019-12-27 03:07:28,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:28" (1/1) ... [2019-12-27 03:07:28,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:07:28,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:07:28,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:07:28,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:07:28,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:28" (1/1) ... [2019-12-27 03:07:28,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:28" (1/1) ... [2019-12-27 03:07:28,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:28" (1/1) ... [2019-12-27 03:07:28,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:28" (1/1) ... [2019-12-27 03:07:28,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:28" (1/1) ... [2019-12-27 03:07:28,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:28" (1/1) ... [2019-12-27 03:07:28,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:28" (1/1) ... [2019-12-27 03:07:28,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:07:28,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:07:28,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:07:28,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:07:28,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:28" (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-12-27 03:07:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:07:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:07:28,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:07:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:07:28,493 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:07:28,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:07:28,495 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:07:28,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:07:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:07:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:07:28,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:07:28,504 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:07:29,690 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:07:29,690 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:07:29,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:07:29 BoogieIcfgContainer [2019-12-27 03:07:29,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:07:29,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:07:29,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:07:29,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:07:29,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:07:27" (1/3) ... [2019-12-27 03:07:29,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7f7d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:07:29, skipping insertion in model container [2019-12-27 03:07:29,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:07:28" (2/3) ... [2019-12-27 03:07:29,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7f7d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:07:29, skipping insertion in model container [2019-12-27 03:07:29,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:07:29" (3/3) ... [2019-12-27 03:07:29,700 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_power.opt.i [2019-12-27 03:07:29,710 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:07:29,710 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:07:29,718 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:07:29,720 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:07:29,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,765 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,765 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,796 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,796 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,796 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,797 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,797 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,839 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,840 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,857 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,860 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,861 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:07:29,877 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:07:29,899 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:07:29,899 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:07:29,899 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:07:29,899 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:07:29,899 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:07:29,899 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:07:29,900 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:07:29,900 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:07:29,925 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-27 03:07:29,927 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 03:07:30,114 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 03:07:30,114 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:07:30,174 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 03:07:30,285 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 03:07:30,432 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 03:07:30,432 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:07:30,455 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 03:07:30,502 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-27 03:07:30,504 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:07:38,210 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 03:07:38,320 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 03:07:38,462 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-27 03:07:38,462 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-27 03:07:38,465 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-27 03:07:52,257 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-27 03:07:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-27 03:07:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:07:52,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:52,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:07:52,267 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:52,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:52,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-27 03:07:52,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:52,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922995821] [2019-12-27 03:07:52,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:07:52,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922995821] [2019-12-27 03:07:52,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:52,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:07:52,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534935605] [2019-12-27 03:07:52,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:07:52,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:52,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:07:52,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:07:52,539 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-27 03:07:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:55,431 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-27 03:07:55,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:07:55,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:07:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:56,264 INFO L225 Difference]: With dead ends: 116456 [2019-12-27 03:07:56,265 INFO L226 Difference]: Without dead ends: 114036 [2019-12-27 03:07:56,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:08:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-27 03:08:06,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-27 03:08:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-27 03:08:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-27 03:08:07,529 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-27 03:08:07,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:07,530 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-27 03:08:07,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:08:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-27 03:08:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:08:07,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:07,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:08:07,535 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:07,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:07,536 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-27 03:08:07,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:07,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834808899] [2019-12-27 03:08:07,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:07,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834808899] [2019-12-27 03:08:07,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:07,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:08:07,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358805081] [2019-12-27 03:08:07,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:08:07,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:07,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:08:07,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:08:07,690 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 4 states. [2019-12-27 03:08:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:13,350 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-27 03:08:13,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:08:13,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:08:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:13,985 INFO L225 Difference]: With dead ends: 152998 [2019-12-27 03:08:13,985 INFO L226 Difference]: Without dead ends: 152998 [2019-12-27 03:08:13,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:08:19,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-27 03:08:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-27 03:08:21,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-27 03:08:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-27 03:08:22,200 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-27 03:08:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:22,200 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-27 03:08:22,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:08:22,200 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-27 03:08:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:08:22,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:22,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:08:22,203 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:22,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:22,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-27 03:08:22,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:22,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896460793] [2019-12-27 03:08:22,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:22,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896460793] [2019-12-27 03:08:22,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:22,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:08:22,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809836695] [2019-12-27 03:08:22,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:08:22,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:22,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:08:22,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:08:22,288 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-27 03:08:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:29,138 INFO L93 Difference]: Finished difference Result 198503 states and 719540 transitions. [2019-12-27 03:08:29,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:08:29,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:08:29,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:29,712 INFO L225 Difference]: With dead ends: 198503 [2019-12-27 03:08:29,712 INFO L226 Difference]: Without dead ends: 198503 [2019-12-27 03:08:29,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:08:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198503 states. [2019-12-27 03:08:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198503 to 184484. [2019-12-27 03:08:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184484 states. [2019-12-27 03:08:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184484 states to 184484 states and 671271 transitions. [2019-12-27 03:08:38,870 INFO L78 Accepts]: Start accepts. Automaton has 184484 states and 671271 transitions. Word has length 11 [2019-12-27 03:08:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:38,870 INFO L462 AbstractCegarLoop]: Abstraction has 184484 states and 671271 transitions. [2019-12-27 03:08:38,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:08:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 184484 states and 671271 transitions. [2019-12-27 03:08:38,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 03:08:38,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:38,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:08:38,878 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:38,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:38,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1389779890, now seen corresponding path program 1 times [2019-12-27 03:08:38,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:38,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34550458] [2019-12-27 03:08:38,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:38,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34550458] [2019-12-27 03:08:38,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:38,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:08:38,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502016157] [2019-12-27 03:08:38,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:08:38,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:38,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:08:38,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:08:38,978 INFO L87 Difference]: Start difference. First operand 184484 states and 671271 transitions. Second operand 4 states. [2019-12-27 03:08:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:39,060 INFO L93 Difference]: Finished difference Result 11993 states and 33125 transitions. [2019-12-27 03:08:39,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:08:39,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 03:08:39,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:39,071 INFO L225 Difference]: With dead ends: 11993 [2019-12-27 03:08:39,071 INFO L226 Difference]: Without dead ends: 8737 [2019-12-27 03:08:39,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:08:39,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8737 states. [2019-12-27 03:08:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8737 to 8729. [2019-12-27 03:08:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8729 states. [2019-12-27 03:08:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8729 states to 8729 states and 21886 transitions. [2019-12-27 03:08:39,183 INFO L78 Accepts]: Start accepts. Automaton has 8729 states and 21886 transitions. Word has length 17 [2019-12-27 03:08:39,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:39,183 INFO L462 AbstractCegarLoop]: Abstraction has 8729 states and 21886 transitions. [2019-12-27 03:08:39,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:08:39,183 INFO L276 IsEmpty]: Start isEmpty. Operand 8729 states and 21886 transitions. [2019-12-27 03:08:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:08:39,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:39,185 INFO L411 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] [2019-12-27 03:08:39,185 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:39,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:39,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-27 03:08:39,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:39,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390124417] [2019-12-27 03:08:39,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:39,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390124417] [2019-12-27 03:08:39,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:39,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:08:39,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565615874] [2019-12-27 03:08:39,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:08:39,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:39,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:08:39,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:08:39,414 INFO L87 Difference]: Start difference. First operand 8729 states and 21886 transitions. Second operand 7 states. [2019-12-27 03:08:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:40,735 INFO L93 Difference]: Finished difference Result 10286 states and 25434 transitions. [2019-12-27 03:08:40,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:08:40,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-27 03:08:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:40,746 INFO L225 Difference]: With dead ends: 10286 [2019-12-27 03:08:40,746 INFO L226 Difference]: Without dead ends: 10286 [2019-12-27 03:08:40,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:08:40,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10286 states. [2019-12-27 03:08:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10286 to 10191. [2019-12-27 03:08:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10191 states. [2019-12-27 03:08:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10191 states to 10191 states and 25249 transitions. [2019-12-27 03:08:40,859 INFO L78 Accepts]: Start accepts. Automaton has 10191 states and 25249 transitions. Word has length 25 [2019-12-27 03:08:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:40,860 INFO L462 AbstractCegarLoop]: Abstraction has 10191 states and 25249 transitions. [2019-12-27 03:08:40,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:08:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 10191 states and 25249 transitions. [2019-12-27 03:08:40,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 03:08:40,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:40,866 INFO L411 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] [2019-12-27 03:08:40,866 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:40,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:40,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-27 03:08:40,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:40,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280971414] [2019-12-27 03:08:40,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:41,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280971414] [2019-12-27 03:08:41,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:41,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:08:41,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696316518] [2019-12-27 03:08:41,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:08:41,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:41,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:08:41,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:08:41,028 INFO L87 Difference]: Start difference. First operand 10191 states and 25249 transitions. Second operand 8 states. [2019-12-27 03:08:42,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:42,222 INFO L93 Difference]: Finished difference Result 11186 states and 27316 transitions. [2019-12-27 03:08:42,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:08:42,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-12-27 03:08:42,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:42,236 INFO L225 Difference]: With dead ends: 11186 [2019-12-27 03:08:42,236 INFO L226 Difference]: Without dead ends: 11138 [2019-12-27 03:08:42,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:08:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2019-12-27 03:08:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 10951. [2019-12-27 03:08:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10951 states. [2019-12-27 03:08:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10951 states to 10951 states and 26866 transitions. [2019-12-27 03:08:42,443 INFO L78 Accepts]: Start accepts. Automaton has 10951 states and 26866 transitions. Word has length 38 [2019-12-27 03:08:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:42,444 INFO L462 AbstractCegarLoop]: Abstraction has 10951 states and 26866 transitions. [2019-12-27 03:08:42,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:08:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 10951 states and 26866 transitions. [2019-12-27 03:08:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 03:08:42,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:42,462 INFO L411 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] [2019-12-27 03:08:42,463 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:42,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:42,463 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-27 03:08:42,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:42,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513800071] [2019-12-27 03:08:42,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:43,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:43,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513800071] [2019-12-27 03:08:43,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:43,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:08:43,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915885344] [2019-12-27 03:08:43,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:08:43,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:43,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:08:43,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:08:43,018 INFO L87 Difference]: Start difference. First operand 10951 states and 26866 transitions. Second operand 9 states. [2019-12-27 03:08:45,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:45,207 INFO L93 Difference]: Finished difference Result 13021 states and 31545 transitions. [2019-12-27 03:08:45,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 03:08:45,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-12-27 03:08:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:45,223 INFO L225 Difference]: With dead ends: 13021 [2019-12-27 03:08:45,223 INFO L226 Difference]: Without dead ends: 13021 [2019-12-27 03:08:45,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:08:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13021 states. [2019-12-27 03:08:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13021 to 11791. [2019-12-27 03:08:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11791 states. [2019-12-27 03:08:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11791 states to 11791 states and 28782 transitions. [2019-12-27 03:08:45,418 INFO L78 Accepts]: Start accepts. Automaton has 11791 states and 28782 transitions. Word has length 50 [2019-12-27 03:08:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:45,418 INFO L462 AbstractCegarLoop]: Abstraction has 11791 states and 28782 transitions. [2019-12-27 03:08:45,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:08:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 11791 states and 28782 transitions. [2019-12-27 03:08:45,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 03:08:45,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:45,431 INFO L411 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] [2019-12-27 03:08:45,431 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:45,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:45,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1176117867, now seen corresponding path program 1 times [2019-12-27 03:08:45,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:45,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138691656] [2019-12-27 03:08:45,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:45,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138691656] [2019-12-27 03:08:45,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:45,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:08:45,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094128379] [2019-12-27 03:08:45,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:08:45,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:45,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:08:45,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:08:45,518 INFO L87 Difference]: Start difference. First operand 11791 states and 28782 transitions. Second operand 5 states. [2019-12-27 03:08:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:46,558 INFO L93 Difference]: Finished difference Result 13152 states and 31669 transitions. [2019-12-27 03:08:46,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:08:46,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 03:08:46,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:46,584 INFO L225 Difference]: With dead ends: 13152 [2019-12-27 03:08:46,584 INFO L226 Difference]: Without dead ends: 13152 [2019-12-27 03:08:46,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:08:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13152 states. [2019-12-27 03:08:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13152 to 12781. [2019-12-27 03:08:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12781 states. [2019-12-27 03:08:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12781 states to 12781 states and 30933 transitions. [2019-12-27 03:08:46,819 INFO L78 Accepts]: Start accepts. Automaton has 12781 states and 30933 transitions. Word has length 57 [2019-12-27 03:08:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:46,819 INFO L462 AbstractCegarLoop]: Abstraction has 12781 states and 30933 transitions. [2019-12-27 03:08:46,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:08:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 12781 states and 30933 transitions. [2019-12-27 03:08:46,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 03:08:46,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:46,834 INFO L411 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] [2019-12-27 03:08:46,834 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:46,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:46,835 INFO L82 PathProgramCache]: Analyzing trace with hash -313859631, now seen corresponding path program 1 times [2019-12-27 03:08:46,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:46,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096183696] [2019-12-27 03:08:46,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:46,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096183696] [2019-12-27 03:08:46,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:46,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:08:46,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083662651] [2019-12-27 03:08:46,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:08:46,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:46,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:08:46,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:08:46,963 INFO L87 Difference]: Start difference. First operand 12781 states and 30933 transitions. Second operand 5 states. [2019-12-27 03:08:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:47,022 INFO L93 Difference]: Finished difference Result 5405 states and 12587 transitions. [2019-12-27 03:08:47,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:08:47,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 03:08:47,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:47,030 INFO L225 Difference]: With dead ends: 5405 [2019-12-27 03:08:47,030 INFO L226 Difference]: Without dead ends: 5151 [2019-12-27 03:08:47,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:08:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2019-12-27 03:08:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 4998. [2019-12-27 03:08:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-12-27 03:08:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 11757 transitions. [2019-12-27 03:08:47,101 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 11757 transitions. Word has length 58 [2019-12-27 03:08:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:47,101 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 11757 transitions. [2019-12-27 03:08:47,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:08:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 11757 transitions. [2019-12-27 03:08:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:08:47,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:47,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:08:47,109 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:47,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:47,109 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-27 03:08:47,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:47,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889880845] [2019-12-27 03:08:47,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:47,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889880845] [2019-12-27 03:08:47,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:47,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:08:47,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529276705] [2019-12-27 03:08:47,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:08:47,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:47,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:08:47,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:08:47,228 INFO L87 Difference]: Start difference. First operand 4998 states and 11757 transitions. Second operand 3 states. [2019-12-27 03:08:47,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:47,311 INFO L93 Difference]: Finished difference Result 4998 states and 11711 transitions. [2019-12-27 03:08:47,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:08:47,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-27 03:08:47,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:47,321 INFO L225 Difference]: With dead ends: 4998 [2019-12-27 03:08:47,321 INFO L226 Difference]: Without dead ends: 4998 [2019-12-27 03:08:47,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:08:47,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4998 states. [2019-12-27 03:08:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4998 to 4986. [2019-12-27 03:08:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4986 states. [2019-12-27 03:08:47,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4986 states to 4986 states and 11689 transitions. [2019-12-27 03:08:47,432 INFO L78 Accepts]: Start accepts. Automaton has 4986 states and 11689 transitions. Word has length 94 [2019-12-27 03:08:47,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:47,433 INFO L462 AbstractCegarLoop]: Abstraction has 4986 states and 11689 transitions. [2019-12-27 03:08:47,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:08:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4986 states and 11689 transitions. [2019-12-27 03:08:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 03:08:47,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:47,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:08:47,445 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:47,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:47,446 INFO L82 PathProgramCache]: Analyzing trace with hash 154163826, now seen corresponding path program 1 times [2019-12-27 03:08:47,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:47,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417013551] [2019-12-27 03:08:47,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:47,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417013551] [2019-12-27 03:08:47,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:47,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:08:47,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97895225] [2019-12-27 03:08:47,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:08:47,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:47,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:08:47,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:08:47,634 INFO L87 Difference]: Start difference. First operand 4986 states and 11689 transitions. Second operand 6 states. [2019-12-27 03:08:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:48,289 INFO L93 Difference]: Finished difference Result 5215 states and 12144 transitions. [2019-12-27 03:08:48,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:08:48,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 03:08:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:48,298 INFO L225 Difference]: With dead ends: 5215 [2019-12-27 03:08:48,298 INFO L226 Difference]: Without dead ends: 5215 [2019-12-27 03:08:48,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:08:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5215 states. [2019-12-27 03:08:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5215 to 4998. [2019-12-27 03:08:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-12-27 03:08:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 11711 transitions. [2019-12-27 03:08:48,371 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 11711 transitions. Word has length 95 [2019-12-27 03:08:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:48,372 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 11711 transitions. [2019-12-27 03:08:48,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:08:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 11711 transitions. [2019-12-27 03:08:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 03:08:48,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:48,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:08:48,378 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:48,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:48,379 INFO L82 PathProgramCache]: Analyzing trace with hash 594436802, now seen corresponding path program 2 times [2019-12-27 03:08:48,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:48,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780361339] [2019-12-27 03:08:48,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:48,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780361339] [2019-12-27 03:08:48,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:48,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:08:48,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029480991] [2019-12-27 03:08:48,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:08:48,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:48,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:08:48,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:08:48,466 INFO L87 Difference]: Start difference. First operand 4998 states and 11711 transitions. Second operand 5 states. [2019-12-27 03:08:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:48,990 INFO L93 Difference]: Finished difference Result 5486 states and 12718 transitions. [2019-12-27 03:08:48,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:08:48,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 03:08:48,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:48,997 INFO L225 Difference]: With dead ends: 5486 [2019-12-27 03:08:48,998 INFO L226 Difference]: Without dead ends: 5486 [2019-12-27 03:08:48,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:08:49,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5486 states. [2019-12-27 03:08:49,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5486 to 5139. [2019-12-27 03:08:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5139 states. [2019-12-27 03:08:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5139 states to 5139 states and 12032 transitions. [2019-12-27 03:08:49,088 INFO L78 Accepts]: Start accepts. Automaton has 5139 states and 12032 transitions. Word has length 95 [2019-12-27 03:08:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:49,089 INFO L462 AbstractCegarLoop]: Abstraction has 5139 states and 12032 transitions. [2019-12-27 03:08:49,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:08:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 5139 states and 12032 transitions. [2019-12-27 03:08:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 03:08:49,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:49,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:08:49,101 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:49,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:49,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1854124544, now seen corresponding path program 3 times [2019-12-27 03:08:49,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:49,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686627134] [2019-12-27 03:08:49,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:49,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686627134] [2019-12-27 03:08:49,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:49,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:08:49,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717727420] [2019-12-27 03:08:49,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:08:49,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:49,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:08:49,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:08:49,304 INFO L87 Difference]: Start difference. First operand 5139 states and 12032 transitions. Second operand 10 states. [2019-12-27 03:08:49,431 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-12-27 03:08:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:50,454 INFO L93 Difference]: Finished difference Result 12721 states and 28804 transitions. [2019-12-27 03:08:50,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 03:08:50,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-27 03:08:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:50,469 INFO L225 Difference]: With dead ends: 12721 [2019-12-27 03:08:50,469 INFO L226 Difference]: Without dead ends: 10923 [2019-12-27 03:08:50,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-27 03:08:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10923 states. [2019-12-27 03:08:50,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10923 to 6810. [2019-12-27 03:08:50,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6810 states. [2019-12-27 03:08:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6810 states to 6810 states and 16317 transitions. [2019-12-27 03:08:50,610 INFO L78 Accepts]: Start accepts. Automaton has 6810 states and 16317 transitions. Word has length 95 [2019-12-27 03:08:50,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:50,610 INFO L462 AbstractCegarLoop]: Abstraction has 6810 states and 16317 transitions. [2019-12-27 03:08:50,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:08:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 6810 states and 16317 transitions. [2019-12-27 03:08:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 03:08:50,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:50,624 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:08:50,624 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:50,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:50,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1454072868, now seen corresponding path program 4 times [2019-12-27 03:08:50,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:50,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915744540] [2019-12-27 03:08:50,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:50,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915744540] [2019-12-27 03:08:50,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:50,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:08:50,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573192847] [2019-12-27 03:08:50,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:08:50,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:50,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:08:50,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:08:50,775 INFO L87 Difference]: Start difference. First operand 6810 states and 16317 transitions. Second operand 6 states. [2019-12-27 03:08:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:51,376 INFO L93 Difference]: Finished difference Result 7207 states and 17089 transitions. [2019-12-27 03:08:51,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:08:51,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 03:08:51,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:51,385 INFO L225 Difference]: With dead ends: 7207 [2019-12-27 03:08:51,385 INFO L226 Difference]: Without dead ends: 7207 [2019-12-27 03:08:51,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:08:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7207 states. [2019-12-27 03:08:51,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7207 to 6922. [2019-12-27 03:08:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6922 states. [2019-12-27 03:08:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6922 states to 6922 states and 16546 transitions. [2019-12-27 03:08:51,459 INFO L78 Accepts]: Start accepts. Automaton has 6922 states and 16546 transitions. Word has length 95 [2019-12-27 03:08:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:51,460 INFO L462 AbstractCegarLoop]: Abstraction has 6922 states and 16546 transitions. [2019-12-27 03:08:51,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:08:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 6922 states and 16546 transitions. [2019-12-27 03:08:51,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 03:08:51,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:51,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:08:51,469 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:51,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:51,469 INFO L82 PathProgramCache]: Analyzing trace with hash 822691358, now seen corresponding path program 5 times [2019-12-27 03:08:51,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:51,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325858986] [2019-12-27 03:08:51,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:51,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325858986] [2019-12-27 03:08:51,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:51,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:08:51,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997687169] [2019-12-27 03:08:51,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:08:51,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:51,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:08:51,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:08:51,582 INFO L87 Difference]: Start difference. First operand 6922 states and 16546 transitions. Second operand 6 states. [2019-12-27 03:08:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:52,400 INFO L93 Difference]: Finished difference Result 12673 states and 29858 transitions. [2019-12-27 03:08:52,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:08:52,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 03:08:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:52,416 INFO L225 Difference]: With dead ends: 12673 [2019-12-27 03:08:52,417 INFO L226 Difference]: Without dead ends: 12673 [2019-12-27 03:08:52,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:08:52,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12673 states. [2019-12-27 03:08:52,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12673 to 10141. [2019-12-27 03:08:52,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10141 states. [2019-12-27 03:08:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10141 states to 10141 states and 24649 transitions. [2019-12-27 03:08:52,545 INFO L78 Accepts]: Start accepts. Automaton has 10141 states and 24649 transitions. Word has length 95 [2019-12-27 03:08:52,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:52,545 INFO L462 AbstractCegarLoop]: Abstraction has 10141 states and 24649 transitions. [2019-12-27 03:08:52,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:08:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand 10141 states and 24649 transitions. [2019-12-27 03:08:52,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 03:08:52,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:52,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:08:52,558 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:52,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:52,558 INFO L82 PathProgramCache]: Analyzing trace with hash 75442206, now seen corresponding path program 6 times [2019-12-27 03:08:52,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:52,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353740674] [2019-12-27 03:08:52,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:52,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353740674] [2019-12-27 03:08:52,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:52,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:08:52,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981823663] [2019-12-27 03:08:52,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:08:52,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:52,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:08:52,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:08:52,643 INFO L87 Difference]: Start difference. First operand 10141 states and 24649 transitions. Second operand 3 states. [2019-12-27 03:08:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:52,724 INFO L93 Difference]: Finished difference Result 10141 states and 24648 transitions. [2019-12-27 03:08:52,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:08:52,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-27 03:08:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:52,741 INFO L225 Difference]: With dead ends: 10141 [2019-12-27 03:08:52,741 INFO L226 Difference]: Without dead ends: 10141 [2019-12-27 03:08:52,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:08:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10141 states. [2019-12-27 03:08:52,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10141 to 9867. [2019-12-27 03:08:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9867 states. [2019-12-27 03:08:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9867 states to 9867 states and 24108 transitions. [2019-12-27 03:08:52,904 INFO L78 Accepts]: Start accepts. Automaton has 9867 states and 24108 transitions. Word has length 95 [2019-12-27 03:08:52,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:52,904 INFO L462 AbstractCegarLoop]: Abstraction has 9867 states and 24108 transitions. [2019-12-27 03:08:52,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:08:52,904 INFO L276 IsEmpty]: Start isEmpty. Operand 9867 states and 24108 transitions. [2019-12-27 03:08:52,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:08:52,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:52,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:08:52,918 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:52,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:52,918 INFO L82 PathProgramCache]: Analyzing trace with hash -382325470, now seen corresponding path program 1 times [2019-12-27 03:08:52,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:52,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135299628] [2019-12-27 03:08:52,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:53,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135299628] [2019-12-27 03:08:53,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:53,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:08:53,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24647323] [2019-12-27 03:08:53,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:08:53,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:53,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:08:53,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:08:53,110 INFO L87 Difference]: Start difference. First operand 9867 states and 24108 transitions. Second operand 9 states. [2019-12-27 03:08:54,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:54,056 INFO L93 Difference]: Finished difference Result 19678 states and 47679 transitions. [2019-12-27 03:08:54,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 03:08:54,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-27 03:08:54,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:54,075 INFO L225 Difference]: With dead ends: 19678 [2019-12-27 03:08:54,075 INFO L226 Difference]: Without dead ends: 15336 [2019-12-27 03:08:54,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-12-27 03:08:54,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15336 states. [2019-12-27 03:08:54,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15336 to 13500. [2019-12-27 03:08:54,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13500 states. [2019-12-27 03:08:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13500 states to 13500 states and 33123 transitions. [2019-12-27 03:08:54,227 INFO L78 Accepts]: Start accepts. Automaton has 13500 states and 33123 transitions. Word has length 96 [2019-12-27 03:08:54,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:54,228 INFO L462 AbstractCegarLoop]: Abstraction has 13500 states and 33123 transitions. [2019-12-27 03:08:54,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:08:54,228 INFO L276 IsEmpty]: Start isEmpty. Operand 13500 states and 33123 transitions. [2019-12-27 03:08:54,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:08:54,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:54,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:08:54,241 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:54,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:54,241 INFO L82 PathProgramCache]: Analyzing trace with hash -478635746, now seen corresponding path program 2 times [2019-12-27 03:08:54,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:54,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177923720] [2019-12-27 03:08:54,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:54,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177923720] [2019-12-27 03:08:54,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:54,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:08:54,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081921013] [2019-12-27 03:08:54,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:08:54,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:54,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:08:54,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:08:54,567 INFO L87 Difference]: Start difference. First operand 13500 states and 33123 transitions. Second operand 11 states. [2019-12-27 03:08:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:55,717 INFO L93 Difference]: Finished difference Result 21885 states and 53389 transitions. [2019-12-27 03:08:55,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 03:08:55,718 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-27 03:08:55,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:55,742 INFO L225 Difference]: With dead ends: 21885 [2019-12-27 03:08:55,742 INFO L226 Difference]: Without dead ends: 21163 [2019-12-27 03:08:55,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2019-12-27 03:08:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21163 states. [2019-12-27 03:08:55,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21163 to 17407. [2019-12-27 03:08:55,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17407 states. [2019-12-27 03:08:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17407 states to 17407 states and 43441 transitions. [2019-12-27 03:08:55,964 INFO L78 Accepts]: Start accepts. Automaton has 17407 states and 43441 transitions. Word has length 96 [2019-12-27 03:08:55,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:55,965 INFO L462 AbstractCegarLoop]: Abstraction has 17407 states and 43441 transitions. [2019-12-27 03:08:55,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:08:55,965 INFO L276 IsEmpty]: Start isEmpty. Operand 17407 states and 43441 transitions. [2019-12-27 03:08:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:08:55,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:55,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:08:55,983 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:55,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:55,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1047445466, now seen corresponding path program 3 times [2019-12-27 03:08:55,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:55,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036977225] [2019-12-27 03:08:55,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:56,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036977225] [2019-12-27 03:08:56,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:56,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:08:56,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861082121] [2019-12-27 03:08:56,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:08:56,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:56,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:08:56,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:08:56,130 INFO L87 Difference]: Start difference. First operand 17407 states and 43441 transitions. Second operand 9 states. [2019-12-27 03:08:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:57,925 INFO L93 Difference]: Finished difference Result 30373 states and 75729 transitions. [2019-12-27 03:08:57,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 03:08:57,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-27 03:08:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:57,959 INFO L225 Difference]: With dead ends: 30373 [2019-12-27 03:08:57,959 INFO L226 Difference]: Without dead ends: 30328 [2019-12-27 03:08:57,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:08:58,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30328 states. [2019-12-27 03:08:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30328 to 22477. [2019-12-27 03:08:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22477 states. [2019-12-27 03:08:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22477 states to 22477 states and 56517 transitions. [2019-12-27 03:08:58,262 INFO L78 Accepts]: Start accepts. Automaton has 22477 states and 56517 transitions. Word has length 96 [2019-12-27 03:08:58,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:08:58,262 INFO L462 AbstractCegarLoop]: Abstraction has 22477 states and 56517 transitions. [2019-12-27 03:08:58,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:08:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand 22477 states and 56517 transitions. [2019-12-27 03:08:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:08:58,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:08:58,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:08:58,288 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:08:58,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:08:58,289 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 4 times [2019-12-27 03:08:58,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:08:58,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178758653] [2019-12-27 03:08:58,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:08:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:08:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:08:58,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178758653] [2019-12-27 03:08:58,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:08:58,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:08:58,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001455976] [2019-12-27 03:08:58,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:08:58,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:08:58,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:08:58,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:08:58,466 INFO L87 Difference]: Start difference. First operand 22477 states and 56517 transitions. Second operand 10 states. [2019-12-27 03:08:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:08:59,428 INFO L93 Difference]: Finished difference Result 34045 states and 84612 transitions. [2019-12-27 03:08:59,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 03:08:59,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 03:08:59,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:08:59,465 INFO L225 Difference]: With dead ends: 34045 [2019-12-27 03:08:59,466 INFO L226 Difference]: Without dead ends: 32697 [2019-12-27 03:08:59,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:08:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32697 states. [2019-12-27 03:08:59,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32697 to 27367. [2019-12-27 03:08:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27367 states. [2019-12-27 03:09:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27367 states to 27367 states and 69672 transitions. [2019-12-27 03:09:00,018 INFO L78 Accepts]: Start accepts. Automaton has 27367 states and 69672 transitions. Word has length 96 [2019-12-27 03:09:00,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:00,018 INFO L462 AbstractCegarLoop]: Abstraction has 27367 states and 69672 transitions. [2019-12-27 03:09:00,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:09:00,018 INFO L276 IsEmpty]: Start isEmpty. Operand 27367 states and 69672 transitions. [2019-12-27 03:09:00,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:00,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:00,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:00,045 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:00,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:00,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1522168602, now seen corresponding path program 5 times [2019-12-27 03:09:00,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:00,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748960866] [2019-12-27 03:09:00,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:00,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748960866] [2019-12-27 03:09:00,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:00,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:09:00,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763782561] [2019-12-27 03:09:00,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:09:00,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:00,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:09:00,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:09:00,137 INFO L87 Difference]: Start difference. First operand 27367 states and 69672 transitions. Second operand 6 states. [2019-12-27 03:09:00,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:00,377 INFO L93 Difference]: Finished difference Result 29163 states and 73579 transitions. [2019-12-27 03:09:00,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:09:00,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-27 03:09:00,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:00,413 INFO L225 Difference]: With dead ends: 29163 [2019-12-27 03:09:00,413 INFO L226 Difference]: Without dead ends: 27933 [2019-12-27 03:09:00,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:09:00,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27933 states. [2019-12-27 03:09:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27933 to 27221. [2019-12-27 03:09:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27221 states. [2019-12-27 03:09:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27221 states to 27221 states and 69336 transitions. [2019-12-27 03:09:00,755 INFO L78 Accepts]: Start accepts. Automaton has 27221 states and 69336 transitions. Word has length 96 [2019-12-27 03:09:00,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:00,755 INFO L462 AbstractCegarLoop]: Abstraction has 27221 states and 69336 transitions. [2019-12-27 03:09:00,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:09:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 27221 states and 69336 transitions. [2019-12-27 03:09:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:00,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:00,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:00,786 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:00,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:00,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2009108450, now seen corresponding path program 6 times [2019-12-27 03:09:00,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:00,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599345558] [2019-12-27 03:09:00,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:00,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599345558] [2019-12-27 03:09:00,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:00,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:09:00,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265200439] [2019-12-27 03:09:00,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:09:00,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:00,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:09:00,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:09:00,986 INFO L87 Difference]: Start difference. First operand 27221 states and 69336 transitions. Second operand 12 states. [2019-12-27 03:09:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:02,253 INFO L93 Difference]: Finished difference Result 57810 states and 149124 transitions. [2019-12-27 03:09:02,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 03:09:02,253 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-27 03:09:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:02,346 INFO L225 Difference]: With dead ends: 57810 [2019-12-27 03:09:02,346 INFO L226 Difference]: Without dead ends: 51820 [2019-12-27 03:09:02,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2019-12-27 03:09:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51820 states. [2019-12-27 03:09:02,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51820 to 32438. [2019-12-27 03:09:02,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32438 states. [2019-12-27 03:09:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32438 states to 32438 states and 82935 transitions. [2019-12-27 03:09:02,888 INFO L78 Accepts]: Start accepts. Automaton has 32438 states and 82935 transitions. Word has length 96 [2019-12-27 03:09:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:02,888 INFO L462 AbstractCegarLoop]: Abstraction has 32438 states and 82935 transitions. [2019-12-27 03:09:02,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:09:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 32438 states and 82935 transitions. [2019-12-27 03:09:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:03,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:03,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:03,206 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:03,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:03,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2022731266, now seen corresponding path program 7 times [2019-12-27 03:09:03,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:03,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493614361] [2019-12-27 03:09:03,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:03,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493614361] [2019-12-27 03:09:03,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:03,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:09:03,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121709542] [2019-12-27 03:09:03,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:09:03,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:03,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:09:03,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:09:03,367 INFO L87 Difference]: Start difference. First operand 32438 states and 82935 transitions. Second operand 9 states. [2019-12-27 03:09:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:04,251 INFO L93 Difference]: Finished difference Result 43092 states and 107787 transitions. [2019-12-27 03:09:04,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 03:09:04,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-27 03:09:04,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:04,303 INFO L225 Difference]: With dead ends: 43092 [2019-12-27 03:09:04,303 INFO L226 Difference]: Without dead ends: 42407 [2019-12-27 03:09:04,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-12-27 03:09:04,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42407 states. [2019-12-27 03:09:04,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42407 to 33047. [2019-12-27 03:09:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33047 states. [2019-12-27 03:09:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33047 states to 33047 states and 84436 transitions. [2019-12-27 03:09:04,807 INFO L78 Accepts]: Start accepts. Automaton has 33047 states and 84436 transitions. Word has length 96 [2019-12-27 03:09:04,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:04,807 INFO L462 AbstractCegarLoop]: Abstraction has 33047 states and 84436 transitions. [2019-12-27 03:09:04,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:09:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand 33047 states and 84436 transitions. [2019-12-27 03:09:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:04,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:04,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:04,843 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:04,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:04,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1061893144, now seen corresponding path program 8 times [2019-12-27 03:09:04,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:04,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999657036] [2019-12-27 03:09:04,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:05,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999657036] [2019-12-27 03:09:05,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:05,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:09:05,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671477639] [2019-12-27 03:09:05,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 03:09:05,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:05,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 03:09:05,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:09:05,093 INFO L87 Difference]: Start difference. First operand 33047 states and 84436 transitions. Second operand 13 states. [2019-12-27 03:09:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:05,964 INFO L93 Difference]: Finished difference Result 38627 states and 98015 transitions. [2019-12-27 03:09:05,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 03:09:05,964 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-27 03:09:05,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:06,009 INFO L225 Difference]: With dead ends: 38627 [2019-12-27 03:09:06,010 INFO L226 Difference]: Without dead ends: 38597 [2019-12-27 03:09:06,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-12-27 03:09:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38597 states. [2019-12-27 03:09:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38597 to 36815. [2019-12-27 03:09:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36815 states. [2019-12-27 03:09:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36815 states to 36815 states and 94059 transitions. [2019-12-27 03:09:06,484 INFO L78 Accepts]: Start accepts. Automaton has 36815 states and 94059 transitions. Word has length 96 [2019-12-27 03:09:06,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:06,484 INFO L462 AbstractCegarLoop]: Abstraction has 36815 states and 94059 transitions. [2019-12-27 03:09:06,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 03:09:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 36815 states and 94059 transitions. [2019-12-27 03:09:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:06,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:06,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:06,857 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:06,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:06,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1143183034, now seen corresponding path program 9 times [2019-12-27 03:09:06,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:06,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583666536] [2019-12-27 03:09:06,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:07,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583666536] [2019-12-27 03:09:07,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:07,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:09:07,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018516342] [2019-12-27 03:09:07,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:09:07,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:07,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:09:07,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:09:07,020 INFO L87 Difference]: Start difference. First operand 36815 states and 94059 transitions. Second operand 10 states. [2019-12-27 03:09:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:08,020 INFO L93 Difference]: Finished difference Result 51299 states and 129350 transitions. [2019-12-27 03:09:08,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 03:09:08,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 03:09:08,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:08,090 INFO L225 Difference]: With dead ends: 51299 [2019-12-27 03:09:08,090 INFO L226 Difference]: Without dead ends: 50614 [2019-12-27 03:09:08,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:09:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50614 states. [2019-12-27 03:09:08,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50614 to 37127. [2019-12-27 03:09:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37127 states. [2019-12-27 03:09:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37127 states to 37127 states and 95101 transitions. [2019-12-27 03:09:08,693 INFO L78 Accepts]: Start accepts. Automaton has 37127 states and 95101 transitions. Word has length 96 [2019-12-27 03:09:08,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:08,693 INFO L462 AbstractCegarLoop]: Abstraction has 37127 states and 95101 transitions. [2019-12-27 03:09:08,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:09:08,693 INFO L276 IsEmpty]: Start isEmpty. Operand 37127 states and 95101 transitions. [2019-12-27 03:09:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:08,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:08,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:08,737 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:08,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:08,737 INFO L82 PathProgramCache]: Analyzing trace with hash -796103378, now seen corresponding path program 10 times [2019-12-27 03:09:08,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:08,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902352439] [2019-12-27 03:09:08,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:09,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902352439] [2019-12-27 03:09:09,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:09,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:09:09,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967006509] [2019-12-27 03:09:09,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:09:09,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:09,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:09:09,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:09:09,009 INFO L87 Difference]: Start difference. First operand 37127 states and 95101 transitions. Second operand 11 states. [2019-12-27 03:09:12,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:12,783 INFO L93 Difference]: Finished difference Result 73776 states and 187224 transitions. [2019-12-27 03:09:12,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 03:09:12,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-27 03:09:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:12,874 INFO L225 Difference]: With dead ends: 73776 [2019-12-27 03:09:12,874 INFO L226 Difference]: Without dead ends: 73719 [2019-12-27 03:09:12,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=290, Invalid=1116, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 03:09:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73719 states. [2019-12-27 03:09:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73719 to 47449. [2019-12-27 03:09:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47449 states. [2019-12-27 03:09:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47449 states to 47449 states and 121328 transitions. [2019-12-27 03:09:13,957 INFO L78 Accepts]: Start accepts. Automaton has 47449 states and 121328 transitions. Word has length 96 [2019-12-27 03:09:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:13,958 INFO L462 AbstractCegarLoop]: Abstraction has 47449 states and 121328 transitions. [2019-12-27 03:09:13,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:09:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 47449 states and 121328 transitions. [2019-12-27 03:09:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:14,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:14,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:14,002 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:14,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:14,002 INFO L82 PathProgramCache]: Analyzing trace with hash -762405432, now seen corresponding path program 11 times [2019-12-27 03:09:14,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:14,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162072106] [2019-12-27 03:09:14,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:14,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162072106] [2019-12-27 03:09:14,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:14,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:09:14,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122131622] [2019-12-27 03:09:14,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:09:14,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:14,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:09:14,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:09:14,186 INFO L87 Difference]: Start difference. First operand 47449 states and 121328 transitions. Second operand 8 states. [2019-12-27 03:09:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:15,253 INFO L93 Difference]: Finished difference Result 71745 states and 186181 transitions. [2019-12-27 03:09:15,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:09:15,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-12-27 03:09:15,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:15,355 INFO L225 Difference]: With dead ends: 71745 [2019-12-27 03:09:15,355 INFO L226 Difference]: Without dead ends: 71745 [2019-12-27 03:09:15,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:09:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71745 states. [2019-12-27 03:09:15,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71745 to 47515. [2019-12-27 03:09:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47515 states. [2019-12-27 03:09:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47515 states to 47515 states and 121660 transitions. [2019-12-27 03:09:16,599 INFO L78 Accepts]: Start accepts. Automaton has 47515 states and 121660 transitions. Word has length 96 [2019-12-27 03:09:16,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:16,599 INFO L462 AbstractCegarLoop]: Abstraction has 47515 states and 121660 transitions. [2019-12-27 03:09:16,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:09:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 47515 states and 121660 transitions. [2019-12-27 03:09:16,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:16,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:16,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:16,647 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:16,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:16,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2120078170, now seen corresponding path program 12 times [2019-12-27 03:09:16,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:16,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960509633] [2019-12-27 03:09:16,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:16,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960509633] [2019-12-27 03:09:16,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:16,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:09:16,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959637314] [2019-12-27 03:09:16,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:09:16,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:16,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:09:16,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:09:16,829 INFO L87 Difference]: Start difference. First operand 47515 states and 121660 transitions. Second operand 12 states. [2019-12-27 03:09:18,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:18,454 INFO L93 Difference]: Finished difference Result 64898 states and 164339 transitions. [2019-12-27 03:09:18,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 03:09:18,455 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-27 03:09:18,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:18,547 INFO L225 Difference]: With dead ends: 64898 [2019-12-27 03:09:18,547 INFO L226 Difference]: Without dead ends: 64328 [2019-12-27 03:09:18,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:09:18,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64328 states. [2019-12-27 03:09:19,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64328 to 52072. [2019-12-27 03:09:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52072 states. [2019-12-27 03:09:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52072 states to 52072 states and 133796 transitions. [2019-12-27 03:09:19,310 INFO L78 Accepts]: Start accepts. Automaton has 52072 states and 133796 transitions. Word has length 96 [2019-12-27 03:09:19,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:19,311 INFO L462 AbstractCegarLoop]: Abstraction has 52072 states and 133796 transitions. [2019-12-27 03:09:19,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:09:19,311 INFO L276 IsEmpty]: Start isEmpty. Operand 52072 states and 133796 transitions. [2019-12-27 03:09:19,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:19,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:19,360 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:19,360 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:19,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:19,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1629824988, now seen corresponding path program 13 times [2019-12-27 03:09:19,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:19,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798559325] [2019-12-27 03:09:19,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:19,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:19,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798559325] [2019-12-27 03:09:19,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:19,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 03:09:19,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932450924] [2019-12-27 03:09:19,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 03:09:19,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:19,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 03:09:19,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:09:19,766 INFO L87 Difference]: Start difference. First operand 52072 states and 133796 transitions. Second operand 17 states. [2019-12-27 03:09:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:23,571 INFO L93 Difference]: Finished difference Result 66413 states and 168141 transitions. [2019-12-27 03:09:23,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 03:09:23,571 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-12-27 03:09:23,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:23,663 INFO L225 Difference]: With dead ends: 66413 [2019-12-27 03:09:23,663 INFO L226 Difference]: Without dead ends: 65824 [2019-12-27 03:09:23,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=279, Invalid=1613, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 03:09:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65824 states. [2019-12-27 03:09:24,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65824 to 52695. [2019-12-27 03:09:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52695 states. [2019-12-27 03:09:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52695 states to 52695 states and 135535 transitions. [2019-12-27 03:09:24,457 INFO L78 Accepts]: Start accepts. Automaton has 52695 states and 135535 transitions. Word has length 96 [2019-12-27 03:09:24,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:24,458 INFO L462 AbstractCegarLoop]: Abstraction has 52695 states and 135535 transitions. [2019-12-27 03:09:24,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 03:09:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 52695 states and 135535 transitions. [2019-12-27 03:09:24,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:24,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:24,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:24,517 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:24,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:24,517 INFO L82 PathProgramCache]: Analyzing trace with hash 278894772, now seen corresponding path program 14 times [2019-12-27 03:09:24,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:24,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193386491] [2019-12-27 03:09:24,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:24,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193386491] [2019-12-27 03:09:24,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:24,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 03:09:24,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261028040] [2019-12-27 03:09:24,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 03:09:24,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:24,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 03:09:24,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:09:24,761 INFO L87 Difference]: Start difference. First operand 52695 states and 135535 transitions. Second operand 15 states. [2019-12-27 03:09:26,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:26,281 INFO L93 Difference]: Finished difference Result 72114 states and 184010 transitions. [2019-12-27 03:09:26,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 03:09:26,282 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-27 03:09:26,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:26,376 INFO L225 Difference]: With dead ends: 72114 [2019-12-27 03:09:26,376 INFO L226 Difference]: Without dead ends: 71603 [2019-12-27 03:09:26,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2019-12-27 03:09:26,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71603 states. [2019-12-27 03:09:27,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71603 to 58749. [2019-12-27 03:09:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58749 states. [2019-12-27 03:09:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58749 states to 58749 states and 151985 transitions. [2019-12-27 03:09:27,602 INFO L78 Accepts]: Start accepts. Automaton has 58749 states and 151985 transitions. Word has length 96 [2019-12-27 03:09:27,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:27,602 INFO L462 AbstractCegarLoop]: Abstraction has 58749 states and 151985 transitions. [2019-12-27 03:09:27,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 03:09:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 58749 states and 151985 transitions. [2019-12-27 03:09:27,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:27,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:27,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:27,663 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:27,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:27,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1102325600, now seen corresponding path program 15 times [2019-12-27 03:09:27,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:27,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234622304] [2019-12-27 03:09:27,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:27,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234622304] [2019-12-27 03:09:27,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:27,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:09:27,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186792612] [2019-12-27 03:09:27,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:09:27,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:27,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:09:27,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:09:27,843 INFO L87 Difference]: Start difference. First operand 58749 states and 151985 transitions. Second operand 10 states. [2019-12-27 03:09:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:28,966 INFO L93 Difference]: Finished difference Result 71472 states and 180667 transitions. [2019-12-27 03:09:28,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 03:09:28,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 03:09:28,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:29,053 INFO L225 Difference]: With dead ends: 71472 [2019-12-27 03:09:29,053 INFO L226 Difference]: Without dead ends: 70704 [2019-12-27 03:09:29,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:09:29,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70704 states. [2019-12-27 03:09:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70704 to 54469. [2019-12-27 03:09:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54469 states. [2019-12-27 03:09:29,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54469 states to 54469 states and 139703 transitions. [2019-12-27 03:09:29,895 INFO L78 Accepts]: Start accepts. Automaton has 54469 states and 139703 transitions. Word has length 96 [2019-12-27 03:09:29,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:29,896 INFO L462 AbstractCegarLoop]: Abstraction has 54469 states and 139703 transitions. [2019-12-27 03:09:29,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:09:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 54469 states and 139703 transitions. [2019-12-27 03:09:29,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:09:29,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:29,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:29,950 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:29,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:29,950 INFO L82 PathProgramCache]: Analyzing trace with hash -631053076, now seen corresponding path program 16 times [2019-12-27 03:09:29,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:29,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972407451] [2019-12-27 03:09:29,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:30,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972407451] [2019-12-27 03:09:30,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:30,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:09:30,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625099904] [2019-12-27 03:09:30,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:09:30,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:30,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:09:30,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:09:30,172 INFO L87 Difference]: Start difference. First operand 54469 states and 139703 transitions. Second operand 10 states. [2019-12-27 03:09:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:31,988 INFO L93 Difference]: Finished difference Result 86031 states and 221985 transitions. [2019-12-27 03:09:31,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 03:09:31,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 03:09:31,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:32,108 INFO L225 Difference]: With dead ends: 86031 [2019-12-27 03:09:32,109 INFO L226 Difference]: Without dead ends: 85900 [2019-12-27 03:09:32,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:09:32,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85900 states. [2019-12-27 03:09:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85900 to 60712. [2019-12-27 03:09:32,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60712 states. [2019-12-27 03:09:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60712 states to 60712 states and 155834 transitions. [2019-12-27 03:09:33,044 INFO L78 Accepts]: Start accepts. Automaton has 60712 states and 155834 transitions. Word has length 96 [2019-12-27 03:09:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:33,044 INFO L462 AbstractCegarLoop]: Abstraction has 60712 states and 155834 transitions. [2019-12-27 03:09:33,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:09:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 60712 states and 155834 transitions. [2019-12-27 03:09:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:09:33,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:33,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:33,106 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:33,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:33,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1931956007, now seen corresponding path program 1 times [2019-12-27 03:09:33,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:33,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557752729] [2019-12-27 03:09:33,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:33,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557752729] [2019-12-27 03:09:33,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:33,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:09:33,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596847518] [2019-12-27 03:09:33,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:09:33,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:33,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:09:33,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:09:33,241 INFO L87 Difference]: Start difference. First operand 60712 states and 155834 transitions. Second operand 6 states. [2019-12-27 03:09:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:33,521 INFO L93 Difference]: Finished difference Result 60035 states and 153824 transitions. [2019-12-27 03:09:33,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:09:33,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-27 03:09:33,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:33,594 INFO L225 Difference]: With dead ends: 60035 [2019-12-27 03:09:33,594 INFO L226 Difference]: Without dead ends: 60035 [2019-12-27 03:09:33,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:09:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60035 states. [2019-12-27 03:09:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60035 to 51436. [2019-12-27 03:09:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51436 states. [2019-12-27 03:09:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51436 states to 51436 states and 131554 transitions. [2019-12-27 03:09:34,740 INFO L78 Accepts]: Start accepts. Automaton has 51436 states and 131554 transitions. Word has length 97 [2019-12-27 03:09:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:34,740 INFO L462 AbstractCegarLoop]: Abstraction has 51436 states and 131554 transitions. [2019-12-27 03:09:34,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:09:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 51436 states and 131554 transitions. [2019-12-27 03:09:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:09:34,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:34,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:34,793 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:34,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:34,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1220428195, now seen corresponding path program 1 times [2019-12-27 03:09:34,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:34,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255172587] [2019-12-27 03:09:34,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:34,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255172587] [2019-12-27 03:09:34,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:34,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:09:34,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386977122] [2019-12-27 03:09:34,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:09:34,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:34,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:09:34,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:09:34,919 INFO L87 Difference]: Start difference. First operand 51436 states and 131554 transitions. Second operand 7 states. [2019-12-27 03:09:36,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:36,066 INFO L93 Difference]: Finished difference Result 63905 states and 162353 transitions. [2019-12-27 03:09:36,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:09:36,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-27 03:09:36,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:36,149 INFO L225 Difference]: With dead ends: 63905 [2019-12-27 03:09:36,149 INFO L226 Difference]: Without dead ends: 63860 [2019-12-27 03:09:36,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:09:36,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63860 states. [2019-12-27 03:09:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63860 to 56220. [2019-12-27 03:09:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56220 states. [2019-12-27 03:09:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56220 states to 56220 states and 143476 transitions. [2019-12-27 03:09:36,935 INFO L78 Accepts]: Start accepts. Automaton has 56220 states and 143476 transitions. Word has length 97 [2019-12-27 03:09:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:36,936 INFO L462 AbstractCegarLoop]: Abstraction has 56220 states and 143476 transitions. [2019-12-27 03:09:36,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:09:36,936 INFO L276 IsEmpty]: Start isEmpty. Operand 56220 states and 143476 transitions. [2019-12-27 03:09:36,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:09:36,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:36,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:36,996 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:36,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1780327349, now seen corresponding path program 2 times [2019-12-27 03:09:36,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:36,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606117792] [2019-12-27 03:09:36,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:37,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:37,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606117792] [2019-12-27 03:09:37,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:37,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:09:37,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43911274] [2019-12-27 03:09:37,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:09:37,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:37,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:09:37,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:09:37,131 INFO L87 Difference]: Start difference. First operand 56220 states and 143476 transitions. Second operand 8 states. [2019-12-27 03:09:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:38,121 INFO L93 Difference]: Finished difference Result 61476 states and 155867 transitions. [2019-12-27 03:09:38,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:09:38,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-27 03:09:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:38,198 INFO L225 Difference]: With dead ends: 61476 [2019-12-27 03:09:38,198 INFO L226 Difference]: Without dead ends: 61476 [2019-12-27 03:09:38,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:09:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61476 states. [2019-12-27 03:09:39,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61476 to 55339. [2019-12-27 03:09:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55339 states. [2019-12-27 03:09:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55339 states to 55339 states and 141294 transitions. [2019-12-27 03:09:39,303 INFO L78 Accepts]: Start accepts. Automaton has 55339 states and 141294 transitions. Word has length 97 [2019-12-27 03:09:39,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:39,303 INFO L462 AbstractCegarLoop]: Abstraction has 55339 states and 141294 transitions. [2019-12-27 03:09:39,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:09:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 55339 states and 141294 transitions. [2019-12-27 03:09:39,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:09:39,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:39,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:39,364 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:39,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:39,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1166833459, now seen corresponding path program 3 times [2019-12-27 03:09:39,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:39,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364910555] [2019-12-27 03:09:39,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:39,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364910555] [2019-12-27 03:09:39,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:39,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:09:39,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260391329] [2019-12-27 03:09:39,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:09:39,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:39,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:09:39,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:09:39,475 INFO L87 Difference]: Start difference. First operand 55339 states and 141294 transitions. Second operand 7 states. [2019-12-27 03:09:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:40,751 INFO L93 Difference]: Finished difference Result 64690 states and 164464 transitions. [2019-12-27 03:09:40,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 03:09:40,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-27 03:09:40,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:40,837 INFO L225 Difference]: With dead ends: 64690 [2019-12-27 03:09:40,838 INFO L226 Difference]: Without dead ends: 64690 [2019-12-27 03:09:40,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:09:40,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64690 states. [2019-12-27 03:09:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64690 to 57840. [2019-12-27 03:09:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57840 states. [2019-12-27 03:09:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57840 states to 57840 states and 147681 transitions. [2019-12-27 03:09:41,614 INFO L78 Accepts]: Start accepts. Automaton has 57840 states and 147681 transitions. Word has length 97 [2019-12-27 03:09:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:41,614 INFO L462 AbstractCegarLoop]: Abstraction has 57840 states and 147681 transitions. [2019-12-27 03:09:41,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:09:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 57840 states and 147681 transitions. [2019-12-27 03:09:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:09:41,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:41,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:41,672 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:41,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:41,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1279789301, now seen corresponding path program 4 times [2019-12-27 03:09:41,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:41,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085895192] [2019-12-27 03:09:41,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:42,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085895192] [2019-12-27 03:09:42,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:42,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-27 03:09:42,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397768180] [2019-12-27 03:09:42,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 03:09:42,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:42,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 03:09:42,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2019-12-27 03:09:42,314 INFO L87 Difference]: Start difference. First operand 57840 states and 147681 transitions. Second operand 25 states. [2019-12-27 03:09:45,224 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-12-27 03:09:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:09:52,550 INFO L93 Difference]: Finished difference Result 92268 states and 234190 transitions. [2019-12-27 03:09:52,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-12-27 03:09:52,552 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 97 [2019-12-27 03:09:52,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:09:52,669 INFO L225 Difference]: With dead ends: 92268 [2019-12-27 03:09:52,670 INFO L226 Difference]: Without dead ends: 86660 [2019-12-27 03:09:52,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3408 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1015, Invalid=9697, Unknown=0, NotChecked=0, Total=10712 [2019-12-27 03:09:52,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86660 states. [2019-12-27 03:09:53,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86660 to 67602. [2019-12-27 03:09:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67602 states. [2019-12-27 03:09:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67602 states to 67602 states and 173077 transitions. [2019-12-27 03:09:54,222 INFO L78 Accepts]: Start accepts. Automaton has 67602 states and 173077 transitions. Word has length 97 [2019-12-27 03:09:54,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:09:54,222 INFO L462 AbstractCegarLoop]: Abstraction has 67602 states and 173077 transitions. [2019-12-27 03:09:54,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 03:09:54,222 INFO L276 IsEmpty]: Start isEmpty. Operand 67602 states and 173077 transitions. [2019-12-27 03:09:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:09:54,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:09:54,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:09:54,294 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:09:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:09:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1999136157, now seen corresponding path program 5 times [2019-12-27 03:09:54,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:09:54,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540264060] [2019-12-27 03:09:54,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:09:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:09:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:09:54,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540264060] [2019-12-27 03:09:54,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:09:54,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 03:09:54,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816419636] [2019-12-27 03:09:54,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 03:09:54,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:09:54,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 03:09:54,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-27 03:09:54,681 INFO L87 Difference]: Start difference. First operand 67602 states and 173077 transitions. Second operand 20 states. [2019-12-27 03:10:00,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:00,056 INFO L93 Difference]: Finished difference Result 102661 states and 261256 transitions. [2019-12-27 03:10:00,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 03:10:00,056 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2019-12-27 03:10:00,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:00,184 INFO L225 Difference]: With dead ends: 102661 [2019-12-27 03:10:00,185 INFO L226 Difference]: Without dead ends: 94495 [2019-12-27 03:10:00,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=323, Invalid=2647, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 03:10:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94495 states. [2019-12-27 03:10:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94495 to 66708. [2019-12-27 03:10:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66708 states. [2019-12-27 03:10:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66708 states to 66708 states and 170926 transitions. [2019-12-27 03:10:01,203 INFO L78 Accepts]: Start accepts. Automaton has 66708 states and 170926 transitions. Word has length 97 [2019-12-27 03:10:01,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:01,204 INFO L462 AbstractCegarLoop]: Abstraction has 66708 states and 170926 transitions. [2019-12-27 03:10:01,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 03:10:01,204 INFO L276 IsEmpty]: Start isEmpty. Operand 66708 states and 170926 transitions. [2019-12-27 03:10:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:10:01,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:01,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:10:01,745 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:01,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:01,746 INFO L82 PathProgramCache]: Analyzing trace with hash -522924491, now seen corresponding path program 6 times [2019-12-27 03:10:01,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:01,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224225788] [2019-12-27 03:10:01,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:01,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224225788] [2019-12-27 03:10:01,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:01,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:10:01,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074928164] [2019-12-27 03:10:01,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:10:01,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:01,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:10:01,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:10:01,898 INFO L87 Difference]: Start difference. First operand 66708 states and 170926 transitions. Second operand 9 states. [2019-12-27 03:10:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:03,116 INFO L93 Difference]: Finished difference Result 69282 states and 176961 transitions. [2019-12-27 03:10:03,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:10:03,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-27 03:10:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:03,237 INFO L225 Difference]: With dead ends: 69282 [2019-12-27 03:10:03,237 INFO L226 Difference]: Without dead ends: 69282 [2019-12-27 03:10:03,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:10:03,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69282 states. [2019-12-27 03:10:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69282 to 68027. [2019-12-27 03:10:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68027 states. [2019-12-27 03:10:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68027 states to 68027 states and 174125 transitions. [2019-12-27 03:10:04,129 INFO L78 Accepts]: Start accepts. Automaton has 68027 states and 174125 transitions. Word has length 97 [2019-12-27 03:10:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:04,129 INFO L462 AbstractCegarLoop]: Abstraction has 68027 states and 174125 transitions. [2019-12-27 03:10:04,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:10:04,130 INFO L276 IsEmpty]: Start isEmpty. Operand 68027 states and 174125 transitions. [2019-12-27 03:10:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:10:04,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:04,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:10:04,209 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1745288123, now seen corresponding path program 7 times [2019-12-27 03:10:04,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:04,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985225006] [2019-12-27 03:10:04,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:04,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985225006] [2019-12-27 03:10:04,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:04,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:10:04,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239359426] [2019-12-27 03:10:04,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:10:04,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:04,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:10:04,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:10:04,361 INFO L87 Difference]: Start difference. First operand 68027 states and 174125 transitions. Second operand 8 states. [2019-12-27 03:10:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:05,405 INFO L93 Difference]: Finished difference Result 88954 states and 229935 transitions. [2019-12-27 03:10:05,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:10:05,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-27 03:10:05,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:05,531 INFO L225 Difference]: With dead ends: 88954 [2019-12-27 03:10:05,531 INFO L226 Difference]: Without dead ends: 88954 [2019-12-27 03:10:05,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:10:05,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88954 states. [2019-12-27 03:10:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88954 to 66550. [2019-12-27 03:10:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66550 states. [2019-12-27 03:10:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66550 states to 66550 states and 170205 transitions. [2019-12-27 03:10:06,860 INFO L78 Accepts]: Start accepts. Automaton has 66550 states and 170205 transitions. Word has length 97 [2019-12-27 03:10:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:06,860 INFO L462 AbstractCegarLoop]: Abstraction has 66550 states and 170205 transitions. [2019-12-27 03:10:06,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:10:06,860 INFO L276 IsEmpty]: Start isEmpty. Operand 66550 states and 170205 transitions. [2019-12-27 03:10:06,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:10:06,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:06,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:10:06,929 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:06,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:06,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1192282811, now seen corresponding path program 8 times [2019-12-27 03:10:06,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:06,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859738942] [2019-12-27 03:10:06,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:07,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859738942] [2019-12-27 03:10:07,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:07,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:10:07,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718938214] [2019-12-27 03:10:07,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:10:07,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:07,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:10:07,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:10:07,124 INFO L87 Difference]: Start difference. First operand 66550 states and 170205 transitions. Second operand 10 states. [2019-12-27 03:10:08,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:08,734 INFO L93 Difference]: Finished difference Result 100911 states and 259399 transitions. [2019-12-27 03:10:08,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 03:10:08,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-27 03:10:08,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:08,869 INFO L225 Difference]: With dead ends: 100911 [2019-12-27 03:10:08,869 INFO L226 Difference]: Without dead ends: 100854 [2019-12-27 03:10:08,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-12-27 03:10:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100854 states. [2019-12-27 03:10:09,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100854 to 63502. [2019-12-27 03:10:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63502 states. [2019-12-27 03:10:09,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63502 states to 63502 states and 161875 transitions. [2019-12-27 03:10:09,888 INFO L78 Accepts]: Start accepts. Automaton has 63502 states and 161875 transitions. Word has length 97 [2019-12-27 03:10:09,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:09,888 INFO L462 AbstractCegarLoop]: Abstraction has 63502 states and 161875 transitions. [2019-12-27 03:10:09,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:10:09,888 INFO L276 IsEmpty]: Start isEmpty. Operand 63502 states and 161875 transitions. [2019-12-27 03:10:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:10:09,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:09,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:10:09,953 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:09,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:09,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1147784417, now seen corresponding path program 9 times [2019-12-27 03:10:09,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:09,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939152049] [2019-12-27 03:10:09,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:10,580 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-27 03:10:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:11,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939152049] [2019-12-27 03:10:11,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:11,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-27 03:10:11,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812416824] [2019-12-27 03:10:11,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 03:10:11,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:11,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 03:10:11,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2019-12-27 03:10:11,028 INFO L87 Difference]: Start difference. First operand 63502 states and 161875 transitions. Second operand 24 states. [2019-12-27 03:10:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:20,324 INFO L93 Difference]: Finished difference Result 108015 states and 276532 transitions. [2019-12-27 03:10:20,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-27 03:10:20,325 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 97 [2019-12-27 03:10:20,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:20,474 INFO L225 Difference]: With dead ends: 108015 [2019-12-27 03:10:20,474 INFO L226 Difference]: Without dead ends: 107652 [2019-12-27 03:10:20,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1801 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=766, Invalid=4934, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 03:10:20,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107652 states. [2019-12-27 03:10:21,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107652 to 66108. [2019-12-27 03:10:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66108 states. [2019-12-27 03:10:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66108 states to 66108 states and 168379 transitions. [2019-12-27 03:10:21,878 INFO L78 Accepts]: Start accepts. Automaton has 66108 states and 168379 transitions. Word has length 97 [2019-12-27 03:10:21,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:21,879 INFO L462 AbstractCegarLoop]: Abstraction has 66108 states and 168379 transitions. [2019-12-27 03:10:21,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 03:10:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 66108 states and 168379 transitions. [2019-12-27 03:10:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:10:21,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:21,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:10:21,946 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:21,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:21,947 INFO L82 PathProgramCache]: Analyzing trace with hash 632383657, now seen corresponding path program 10 times [2019-12-27 03:10:21,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:21,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738907501] [2019-12-27 03:10:21,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:22,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738907501] [2019-12-27 03:10:22,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:22,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:10:22,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994001493] [2019-12-27 03:10:22,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:10:22,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:22,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:10:22,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:10:22,123 INFO L87 Difference]: Start difference. First operand 66108 states and 168379 transitions. Second operand 10 states. [2019-12-27 03:10:23,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:23,955 INFO L93 Difference]: Finished difference Result 95835 states and 246569 transitions. [2019-12-27 03:10:23,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 03:10:23,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-27 03:10:23,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:24,082 INFO L225 Difference]: With dead ends: 95835 [2019-12-27 03:10:24,082 INFO L226 Difference]: Without dead ends: 95835 [2019-12-27 03:10:24,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2019-12-27 03:10:24,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95835 states. [2019-12-27 03:10:24,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95835 to 66004. [2019-12-27 03:10:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66004 states. [2019-12-27 03:10:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66004 states to 66004 states and 168124 transitions. [2019-12-27 03:10:25,098 INFO L78 Accepts]: Start accepts. Automaton has 66004 states and 168124 transitions. Word has length 97 [2019-12-27 03:10:25,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:25,098 INFO L462 AbstractCegarLoop]: Abstraction has 66004 states and 168124 transitions. [2019-12-27 03:10:25,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:10:25,098 INFO L276 IsEmpty]: Start isEmpty. Operand 66004 states and 168124 transitions. [2019-12-27 03:10:25,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 03:10:25,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:25,632 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:10:25,632 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:25,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:25,632 INFO L82 PathProgramCache]: Analyzing trace with hash -834110696, now seen corresponding path program 1 times [2019-12-27 03:10:25,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:25,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082106264] [2019-12-27 03:10:25,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:26,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082106264] [2019-12-27 03:10:26,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:26,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 03:10:26,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940497371] [2019-12-27 03:10:26,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 03:10:26,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:26,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 03:10:26,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:10:26,132 INFO L87 Difference]: Start difference. First operand 66004 states and 168124 transitions. Second operand 15 states. [2019-12-27 03:10:32,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:32,495 INFO L93 Difference]: Finished difference Result 128680 states and 326253 transitions. [2019-12-27 03:10:32,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 03:10:32,496 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2019-12-27 03:10:32,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:32,659 INFO L225 Difference]: With dead ends: 128680 [2019-12-27 03:10:32,660 INFO L226 Difference]: Without dead ends: 117745 [2019-12-27 03:10:32,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=447, Invalid=2745, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 03:10:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117745 states. [2019-12-27 03:10:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117745 to 87406. [2019-12-27 03:10:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87406 states. [2019-12-27 03:10:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87406 states to 87406 states and 225061 transitions. [2019-12-27 03:10:34,346 INFO L78 Accepts]: Start accepts. Automaton has 87406 states and 225061 transitions. Word has length 98 [2019-12-27 03:10:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:34,346 INFO L462 AbstractCegarLoop]: Abstraction has 87406 states and 225061 transitions. [2019-12-27 03:10:34,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 03:10:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 87406 states and 225061 transitions. [2019-12-27 03:10:34,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 03:10:34,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:34,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:10:34,451 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:34,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:34,451 INFO L82 PathProgramCache]: Analyzing trace with hash -758422154, now seen corresponding path program 2 times [2019-12-27 03:10:34,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:34,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115814219] [2019-12-27 03:10:34,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:35,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115814219] [2019-12-27 03:10:35,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:35,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 03:10:35,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984209941] [2019-12-27 03:10:35,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 03:10:35,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:35,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 03:10:35,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-12-27 03:10:35,535 INFO L87 Difference]: Start difference. First operand 87406 states and 225061 transitions. Second operand 20 states. [2019-12-27 03:10:43,812 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-12-27 03:10:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:46,525 INFO L93 Difference]: Finished difference Result 107019 states and 273830 transitions. [2019-12-27 03:10:46,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-12-27 03:10:46,526 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 98 [2019-12-27 03:10:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:46,679 INFO L225 Difference]: With dead ends: 107019 [2019-12-27 03:10:46,679 INFO L226 Difference]: Without dead ends: 105551 [2019-12-27 03:10:46,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=920, Invalid=6052, Unknown=0, NotChecked=0, Total=6972 [2019-12-27 03:10:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105551 states. [2019-12-27 03:10:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105551 to 88041. [2019-12-27 03:10:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88041 states. [2019-12-27 03:10:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88041 states to 88041 states and 226697 transitions. [2019-12-27 03:10:47,864 INFO L78 Accepts]: Start accepts. Automaton has 88041 states and 226697 transitions. Word has length 98 [2019-12-27 03:10:47,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:47,864 INFO L462 AbstractCegarLoop]: Abstraction has 88041 states and 226697 transitions. [2019-12-27 03:10:47,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 03:10:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 88041 states and 226697 transitions. [2019-12-27 03:10:47,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 03:10:47,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:47,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:10:47,969 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:47,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:47,969 INFO L82 PathProgramCache]: Analyzing trace with hash 820119886, now seen corresponding path program 3 times [2019-12-27 03:10:47,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:47,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823754776] [2019-12-27 03:10:47,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:48,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823754776] [2019-12-27 03:10:48,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:48,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-27 03:10:48,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68609000] [2019-12-27 03:10:48,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 03:10:48,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:48,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 03:10:48,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-12-27 03:10:48,871 INFO L87 Difference]: Start difference. First operand 88041 states and 226697 transitions. Second operand 23 states. [2019-12-27 03:10:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:10:54,285 INFO L93 Difference]: Finished difference Result 99671 states and 255386 transitions. [2019-12-27 03:10:54,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 03:10:54,286 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 98 [2019-12-27 03:10:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:10:54,427 INFO L225 Difference]: With dead ends: 99671 [2019-12-27 03:10:54,427 INFO L226 Difference]: Without dead ends: 98495 [2019-12-27 03:10:54,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 03:10:54,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98495 states. [2019-12-27 03:10:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98495 to 92785. [2019-12-27 03:10:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92785 states. [2019-12-27 03:10:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92785 states to 92785 states and 238626 transitions. [2019-12-27 03:10:55,664 INFO L78 Accepts]: Start accepts. Automaton has 92785 states and 238626 transitions. Word has length 98 [2019-12-27 03:10:55,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:10:55,664 INFO L462 AbstractCegarLoop]: Abstraction has 92785 states and 238626 transitions. [2019-12-27 03:10:55,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 03:10:55,664 INFO L276 IsEmpty]: Start isEmpty. Operand 92785 states and 238626 transitions. [2019-12-27 03:10:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 03:10:55,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:10:55,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:10:55,778 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:10:55,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:10:55,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1700655026, now seen corresponding path program 4 times [2019-12-27 03:10:55,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:10:55,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882325037] [2019-12-27 03:10:55,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:10:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:10:57,430 WARN L192 SmtUtils]: Spent 577.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-27 03:10:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:10:57,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882325037] [2019-12-27 03:10:57,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:10:57,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-27 03:10:57,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946526444] [2019-12-27 03:10:57,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 03:10:57,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:10:57,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 03:10:57,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:10:57,509 INFO L87 Difference]: Start difference. First operand 92785 states and 238626 transitions. Second operand 26 states. Received shutdown request... [2019-12-27 03:11:06,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-12-27 03:11:06,686 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 03:11:06,691 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 03:11:06,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:11:06 BasicIcfg [2019-12-27 03:11:06,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:11:06,693 INFO L168 Benchmark]: Toolchain (without parser) took 219258.41 ms. Allocated memory was 138.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 102.0 MB in the beginning and 856.0 MB in the end (delta: -754.0 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-27 03:11:06,693 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 03:11:06,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 840.96 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 101.6 MB in the beginning and 153.4 MB in the end (delta: -51.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:11:06,694 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.03 ms. Allocated memory is still 202.4 MB. Free memory was 153.4 MB in the beginning and 149.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:11:06,694 INFO L168 Benchmark]: Boogie Preprocessor took 47.77 ms. Allocated memory is still 202.4 MB. Free memory was 149.5 MB in the beginning and 146.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:11:06,694 INFO L168 Benchmark]: RCFGBuilder took 1292.56 ms. Allocated memory was 202.4 MB in the beginning and 236.5 MB in the end (delta: 34.1 MB). Free memory was 146.3 MB in the beginning and 191.6 MB in the end (delta: -45.3 MB). Peak memory consumption was 64.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:11:06,695 INFO L168 Benchmark]: TraceAbstraction took 216999.10 ms. Allocated memory was 236.5 MB in the beginning and 3.8 GB in the end (delta: 3.5 GB). Free memory was 191.6 MB in the beginning and 856.0 MB in the end (delta: -664.4 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-27 03:11:06,696 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 840.96 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 101.6 MB in the beginning and 153.4 MB in the end (delta: -51.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.03 ms. Allocated memory is still 202.4 MB. Free memory was 153.4 MB in the beginning and 149.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.77 ms. Allocated memory is still 202.4 MB. Free memory was 149.5 MB in the beginning and 146.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1292.56 ms. Allocated memory was 202.4 MB in the beginning and 236.5 MB in the end (delta: 34.1 MB). Free memory was 146.3 MB in the beginning and 191.6 MB in the end (delta: -45.3 MB). Peak memory consumption was 64.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 216999.10 ms. Allocated memory was 236.5 MB in the beginning and 3.8 GB in the end (delta: 3.5 GB). Free memory was 191.6 MB in the beginning and 856.0 MB in the end (delta: -664.4 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.5s, 244 ProgramPointsBefore, 154 ProgramPointsAfterwards, 326 TransitionsBefore, 193 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 46 ChoiceCompositions, 19062 VarBasedMoverChecksPositive, 524 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 479 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.2s, 0 MoverChecksTotal, 326763 CheckedPairsTotal, 143 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (92785states) and FLOYD_HOARE automaton (currently 81 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (30557 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (92785states) and FLOYD_HOARE automaton (currently 81 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (30557 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 216.7s, OverallIterations: 47, TraceHistogramMax: 1, AutomataDifference: 120.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 20648 SDtfs, 31411 SDslu, 118361 SDs, 0 SdLazy, 76695 SolverSat, 1937 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 61.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1257 GetRequests, 149 SyntacticMatches, 69 SemanticMatches, 1039 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13905 ImplicationChecksByTransitivity, 26.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184484occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 57.0s AutomataMinimizationTime, 46 MinimizatonAttempts, 479679 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 3931 NumberOfCodeBlocks, 3931 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 3884 ConstructedInterpolants, 0 QuantifiedInterpolants, 1696380 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 47 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown