/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/mix049_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:45:48,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:45:48,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:45:48,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:45:48,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:45:48,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:45:48,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:45:48,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:45:48,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:45:48,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:45:48,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:45:48,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:45:48,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:45:48,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:45:48,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:45:48,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:45:48,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:45:48,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:45:48,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:45:48,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:45:48,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:45:48,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:45:48,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:45:48,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:45:48,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:45:48,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:45:48,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:45:48,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:45:48,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:45:48,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:45:48,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:45:48,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:45:48,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:45:48,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:45:48,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:45:48,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:45:48,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:45:48,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:45:48,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:45:48,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:45:48,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:45:48,226 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 02:45:48,239 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:45:48,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:45:48,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:45:48,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:45:48,241 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:45:48,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:45:48,242 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:45:48,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:45:48,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:45:48,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:45:48,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:45:48,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:45:48,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:45:48,243 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:45:48,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:45:48,243 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:45:48,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:45:48,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:45:48,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:45:48,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:45:48,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:45:48,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:45:48,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:45:48,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:45:48,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:45:48,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:45:48,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:45:48,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:45:48,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:45:48,577 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:45:48,596 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:45:48,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:45:48,603 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:45:48,603 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:45:48,604 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_tso.oepc.i [2019-12-27 02:45:48,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c8580b7d/1928a5a9ebc74f1f94b0afa8639a263f/FLAGbf5c4c99c [2019-12-27 02:45:49,214 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:45:49,214 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_tso.oepc.i [2019-12-27 02:45:49,239 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c8580b7d/1928a5a9ebc74f1f94b0afa8639a263f/FLAGbf5c4c99c [2019-12-27 02:45:49,506 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c8580b7d/1928a5a9ebc74f1f94b0afa8639a263f [2019-12-27 02:45:49,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:45:49,516 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:45:49,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:45:49,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:45:49,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:45:49,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:45:49" (1/1) ... [2019-12-27 02:45:49,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc96705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:49, skipping insertion in model container [2019-12-27 02:45:49,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:45:49" (1/1) ... [2019-12-27 02:45:49,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:45:49,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:45:50,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:45:50,156 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:45:50,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:45:50,320 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:45:50,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:50 WrapperNode [2019-12-27 02:45:50,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:45:50,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:45:50,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:45:50,322 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:45:50,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:50" (1/1) ... [2019-12-27 02:45:50,352 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:50" (1/1) ... [2019-12-27 02:45:50,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:45:50,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:45:50,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:45:50,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:45:50,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:50" (1/1) ... [2019-12-27 02:45:50,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:50" (1/1) ... [2019-12-27 02:45:50,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:50" (1/1) ... [2019-12-27 02:45:50,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:50" (1/1) ... [2019-12-27 02:45:50,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:50" (1/1) ... [2019-12-27 02:45:50,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:50" (1/1) ... [2019-12-27 02:45:50,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:50" (1/1) ... [2019-12-27 02:45:50,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:45:50,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:45:50,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:45:50,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:45:50,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:50" (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 02:45:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:45:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:45:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:45:50,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:45:50,513 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:45:50,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:45:50,513 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:45:50,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:45:50,513 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:45:50,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:45:50,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:45:50,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:45:50,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:45:50,516 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 02:45:51,341 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:45:51,341 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:45:51,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:45:51 BoogieIcfgContainer [2019-12-27 02:45:51,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:45:51,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:45:51,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:45:51,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:45:51,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:45:49" (1/3) ... [2019-12-27 02:45:51,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38aa5dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:45:51, skipping insertion in model container [2019-12-27 02:45:51,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:45:50" (2/3) ... [2019-12-27 02:45:51,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38aa5dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:45:51, skipping insertion in model container [2019-12-27 02:45:51,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:45:51" (3/3) ... [2019-12-27 02:45:51,353 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_tso.oepc.i [2019-12-27 02:45:51,364 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:45:51,364 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:45:51,372 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:45:51,373 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:45:51,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,416 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,416 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,416 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,417 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,417 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,428 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,429 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,462 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,463 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,490 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,492 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,499 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,500 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,500 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,502 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,502 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:45:51,524 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:45:51,541 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:45:51,542 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:45:51,542 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:45:51,542 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:45:51,542 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:45:51,542 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:45:51,542 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:45:51,543 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:45:51,557 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 02:45:51,559 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 02:45:51,670 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 02:45:51,671 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:45:51,690 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:45:51,716 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 02:45:51,785 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 02:45:51,785 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:45:51,793 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:45:51,815 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:45:51,816 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:45:56,995 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 02:45:57,135 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 02:45:57,472 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-27 02:45:57,472 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 02:45:57,476 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 02:46:21,462 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-27 02:46:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-27 02:46:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:46:21,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:21,470 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:46:21,470 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:21,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:21,475 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-27 02:46:21,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:21,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113405025] [2019-12-27 02:46:21,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:21,664 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 02:46:21,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113405025] [2019-12-27 02:46:21,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:21,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:46:21,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85979250] [2019-12-27 02:46:21,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:46:21,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:21,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:46:21,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:46:21,688 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-27 02:46:24,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:24,213 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-27 02:46:24,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:46:24,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:46:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:24,898 INFO L225 Difference]: With dead ends: 125570 [2019-12-27 02:46:24,898 INFO L226 Difference]: Without dead ends: 111010 [2019-12-27 02:46:24,900 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 02:46:32,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-27 02:46:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-27 02:46:34,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-27 02:46:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-27 02:46:39,084 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-27 02:46:39,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:39,084 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-27 02:46:39,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:46:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-27 02:46:39,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:46:39,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:39,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:39,089 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:39,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:39,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-27 02:46:39,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:39,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013231812] [2019-12-27 02:46:39,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:39,194 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 02:46:39,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013231812] [2019-12-27 02:46:39,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:39,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:46:39,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169335395] [2019-12-27 02:46:39,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:46:39,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:39,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:46:39,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:46:39,197 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-27 02:46:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:45,198 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-27 02:46:45,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:46:45,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:46:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:46,014 INFO L225 Difference]: With dead ends: 172646 [2019-12-27 02:46:46,015 INFO L226 Difference]: Without dead ends: 172548 [2019-12-27 02:46:46,016 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 02:46:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-27 02:46:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-27 02:46:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-27 02:46:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-27 02:46:56,180 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-27 02:46:56,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:56,180 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-27 02:46:56,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:46:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-27 02:46:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:46:56,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:56,189 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:56,189 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:56,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:56,189 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-27 02:46:56,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:56,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704406608] [2019-12-27 02:46:56,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:56,264 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 02:46:56,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704406608] [2019-12-27 02:46:56,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:56,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:46:56,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817662884] [2019-12-27 02:46:56,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:46:56,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:56,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:46:56,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:46:56,267 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-27 02:46:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:56,399 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-27 02:46:56,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:46:56,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:46:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:56,460 INFO L225 Difference]: With dead ends: 34208 [2019-12-27 02:46:56,460 INFO L226 Difference]: Without dead ends: 34208 [2019-12-27 02:46:56,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 02:46:56,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-27 02:46:57,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-27 02:46:57,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-27 02:46:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-27 02:46:57,115 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-27 02:46:57,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:46:57,116 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-27 02:46:57,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:46:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-27 02:46:57,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:46:57,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:46:57,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:46:57,121 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:46:57,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:46:57,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-27 02:46:57,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:46:57,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230513064] [2019-12-27 02:46:57,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:46:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:46:57,204 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 02:46:57,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230513064] [2019-12-27 02:46:57,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:46:57,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:46:57,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440797534] [2019-12-27 02:46:57,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:46:57,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:46:57,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:46:57,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:46:57,211 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-27 02:46:57,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:46:57,424 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-27 02:46:57,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:46:57,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 02:46:57,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:46:57,512 INFO L225 Difference]: With dead ends: 51809 [2019-12-27 02:46:57,512 INFO L226 Difference]: Without dead ends: 51809 [2019-12-27 02:46:57,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 02:46:59,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-27 02:47:00,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-27 02:47:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-27 02:47:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-27 02:47:00,310 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-27 02:47:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:00,311 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-27 02:47:00,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:47:00,311 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-27 02:47:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:47:00,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:00,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:47:00,314 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:00,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-27 02:47:00,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:00,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606544888] [2019-12-27 02:47:00,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:00,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 02:47:00,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606544888] [2019-12-27 02:47:00,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:00,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:47:00,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521207227] [2019-12-27 02:47:00,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:47:00,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:00,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:47:00,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:47:00,414 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-27 02:47:00,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:00,982 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-27 02:47:00,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:47:00,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 02:47:00,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:01,069 INFO L225 Difference]: With dead ends: 53507 [2019-12-27 02:47:01,070 INFO L226 Difference]: Without dead ends: 53507 [2019-12-27 02:47:01,070 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 02:47:01,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-27 02:47:01,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-27 02:47:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-27 02:47:02,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-27 02:47:02,481 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-27 02:47:02,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:02,481 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-27 02:47:02,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:47:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-27 02:47:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:47:02,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:02,495 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] [2019-12-27 02:47:02,495 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:02,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:02,495 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-27 02:47:02,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:02,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960958334] [2019-12-27 02:47:02,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:02,585 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 02:47:02,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960958334] [2019-12-27 02:47:02,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:02,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:47:02,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651655549] [2019-12-27 02:47:02,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:47:02,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:02,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:47:02,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:47:02,587 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 6 states. [2019-12-27 02:47:03,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:03,591 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-27 02:47:03,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:47:03,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 02:47:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:03,698 INFO L225 Difference]: With dead ends: 66834 [2019-12-27 02:47:03,698 INFO L226 Difference]: Without dead ends: 66820 [2019-12-27 02:47:03,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:47:04,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-27 02:47:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-27 02:47:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-27 02:47:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-27 02:47:04,681 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-27 02:47:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:04,681 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-27 02:47:04,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:47:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-27 02:47:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:47:04,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:04,699 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 02:47:04,699 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:04,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:04,700 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-27 02:47:04,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:04,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441145032] [2019-12-27 02:47:04,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:04,765 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 02:47:04,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441145032] [2019-12-27 02:47:04,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:04,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:47:04,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152998718] [2019-12-27 02:47:04,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:47:04,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:04,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:47:04,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:47:04,767 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 4 states. [2019-12-27 02:47:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:04,850 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-27 02:47:04,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:47:04,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:47:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:04,876 INFO L225 Difference]: With dead ends: 18127 [2019-12-27 02:47:04,876 INFO L226 Difference]: Without dead ends: 18127 [2019-12-27 02:47:04,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:47:04,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-27 02:47:05,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-27 02:47:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-27 02:47:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-27 02:47:05,593 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-27 02:47:05,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:05,594 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-27 02:47:05,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:47:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-27 02:47:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:47:05,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:05,609 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] [2019-12-27 02:47:05,609 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:05,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:05,609 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-27 02:47:05,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:05,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076345667] [2019-12-27 02:47:05,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:05,695 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 02:47:05,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076345667] [2019-12-27 02:47:05,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:05,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:47:05,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541850734] [2019-12-27 02:47:05,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:47:05,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:05,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:47:05,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:47:05,698 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-27 02:47:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:06,316 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-27 02:47:06,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:47:06,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 02:47:06,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:06,369 INFO L225 Difference]: With dead ends: 25206 [2019-12-27 02:47:06,369 INFO L226 Difference]: Without dead ends: 25206 [2019-12-27 02:47:06,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:47:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-27 02:47:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-27 02:47:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-27 02:47:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-27 02:47:06,858 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-27 02:47:06,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:06,858 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-27 02:47:06,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:47:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-27 02:47:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:47:06,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:06,880 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] [2019-12-27 02:47:06,880 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:06,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:06,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-27 02:47:06,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:06,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871198978] [2019-12-27 02:47:06,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:06,966 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 02:47:06,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871198978] [2019-12-27 02:47:06,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:06,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:47:06,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581254146] [2019-12-27 02:47:06,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:47:06,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:06,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:47:06,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:47:06,969 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 7 states. [2019-12-27 02:47:08,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:08,165 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-27 02:47:08,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:47:08,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:47:08,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:08,205 INFO L225 Difference]: With dead ends: 28185 [2019-12-27 02:47:08,205 INFO L226 Difference]: Without dead ends: 28185 [2019-12-27 02:47:08,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:47:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-27 02:47:08,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-27 02:47:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-27 02:47:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-27 02:47:08,580 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-27 02:47:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:08,580 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-27 02:47:08,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:47:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-27 02:47:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:47:08,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:08,605 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] [2019-12-27 02:47:08,605 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:08,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-27 02:47:08,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:08,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431670534] [2019-12-27 02:47:08,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:08,692 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 02:47:08,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431670534] [2019-12-27 02:47:08,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:08,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:47:08,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648784979] [2019-12-27 02:47:08,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:47:08,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:08,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:47:08,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:47:08,694 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 3 states. [2019-12-27 02:47:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:08,786 INFO L93 Difference]: Finished difference Result 18532 states and 56133 transitions. [2019-12-27 02:47:08,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:47:08,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 02:47:08,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:08,819 INFO L225 Difference]: With dead ends: 18532 [2019-12-27 02:47:08,819 INFO L226 Difference]: Without dead ends: 18532 [2019-12-27 02:47:08,820 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 02:47:08,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18532 states. [2019-12-27 02:47:09,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18532 to 18524. [2019-12-27 02:47:09,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18524 states. [2019-12-27 02:47:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18524 states to 18524 states and 56117 transitions. [2019-12-27 02:47:09,108 INFO L78 Accepts]: Start accepts. Automaton has 18524 states and 56117 transitions. Word has length 39 [2019-12-27 02:47:09,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:09,108 INFO L462 AbstractCegarLoop]: Abstraction has 18524 states and 56117 transitions. [2019-12-27 02:47:09,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:47:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 18524 states and 56117 transitions. [2019-12-27 02:47:09,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:47:09,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:09,131 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] [2019-12-27 02:47:09,131 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:09,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:09,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1220902187, now seen corresponding path program 1 times [2019-12-27 02:47:09,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:09,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401182557] [2019-12-27 02:47:09,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:09,197 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 02:47:09,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401182557] [2019-12-27 02:47:09,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:09,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:47:09,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967063211] [2019-12-27 02:47:09,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:47:09,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:09,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:47:09,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:47:09,199 INFO L87 Difference]: Start difference. First operand 18524 states and 56117 transitions. Second operand 5 states. [2019-12-27 02:47:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:09,301 INFO L93 Difference]: Finished difference Result 17291 states and 53251 transitions. [2019-12-27 02:47:09,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:47:09,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:47:09,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:09,335 INFO L225 Difference]: With dead ends: 17291 [2019-12-27 02:47:09,335 INFO L226 Difference]: Without dead ends: 17291 [2019-12-27 02:47:09,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:47:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17291 states. [2019-12-27 02:47:10,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17291 to 16710. [2019-12-27 02:47:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-27 02:47:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 51682 transitions. [2019-12-27 02:47:10,039 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 51682 transitions. Word has length 40 [2019-12-27 02:47:10,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:10,040 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 51682 transitions. [2019-12-27 02:47:10,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:47:10,040 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 51682 transitions. [2019-12-27 02:47:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:47:10,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:10,056 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] [2019-12-27 02:47:10,057 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:10,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:10,057 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-27 02:47:10,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:10,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600013346] [2019-12-27 02:47:10,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:10,132 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 02:47:10,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600013346] [2019-12-27 02:47:10,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:10,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:47:10,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996386590] [2019-12-27 02:47:10,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:47:10,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:10,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:47:10,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:47:10,135 INFO L87 Difference]: Start difference. First operand 16710 states and 51682 transitions. Second operand 3 states. [2019-12-27 02:47:10,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:10,281 INFO L93 Difference]: Finished difference Result 20999 states and 64475 transitions. [2019-12-27 02:47:10,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:47:10,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:47:10,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:10,317 INFO L225 Difference]: With dead ends: 20999 [2019-12-27 02:47:10,318 INFO L226 Difference]: Without dead ends: 20999 [2019-12-27 02:47:10,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 02:47:10,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20999 states. [2019-12-27 02:47:10,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20999 to 17838. [2019-12-27 02:47:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17838 states. [2019-12-27 02:47:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17838 states to 17838 states and 55279 transitions. [2019-12-27 02:47:10,816 INFO L78 Accepts]: Start accepts. Automaton has 17838 states and 55279 transitions. Word has length 65 [2019-12-27 02:47:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:10,816 INFO L462 AbstractCegarLoop]: Abstraction has 17838 states and 55279 transitions. [2019-12-27 02:47:10,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:47:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 17838 states and 55279 transitions. [2019-12-27 02:47:10,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:10,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:10,845 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] [2019-12-27 02:47:10,845 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:10,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:10,846 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-27 02:47:10,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:10,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264458238] [2019-12-27 02:47:10,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:10,956 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 02:47:10,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264458238] [2019-12-27 02:47:10,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:10,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:47:10,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049768985] [2019-12-27 02:47:10,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:47:10,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:10,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:47:10,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:47:10,959 INFO L87 Difference]: Start difference. First operand 17838 states and 55279 transitions. Second operand 4 states. [2019-12-27 02:47:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:11,115 INFO L93 Difference]: Finished difference Result 21261 states and 65410 transitions. [2019-12-27 02:47:11,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:47:11,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 02:47:11,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:11,151 INFO L225 Difference]: With dead ends: 21261 [2019-12-27 02:47:11,151 INFO L226 Difference]: Without dead ends: 21261 [2019-12-27 02:47:11,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 02:47:11,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21261 states. [2019-12-27 02:47:11,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21261 to 17865. [2019-12-27 02:47:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17865 states. [2019-12-27 02:47:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17865 states to 17865 states and 55278 transitions. [2019-12-27 02:47:11,467 INFO L78 Accepts]: Start accepts. Automaton has 17865 states and 55278 transitions. Word has length 66 [2019-12-27 02:47:11,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:11,468 INFO L462 AbstractCegarLoop]: Abstraction has 17865 states and 55278 transitions. [2019-12-27 02:47:11,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:47:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 17865 states and 55278 transitions. [2019-12-27 02:47:11,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:11,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:11,493 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] [2019-12-27 02:47:11,494 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:11,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:11,494 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-27 02:47:11,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:11,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538574125] [2019-12-27 02:47:11,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:11,667 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 02:47:11,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538574125] [2019-12-27 02:47:11,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:11,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:47:11,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743479087] [2019-12-27 02:47:11,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:47:11,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:11,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:47:11,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:47:11,670 INFO L87 Difference]: Start difference. First operand 17865 states and 55278 transitions. Second operand 10 states. [2019-12-27 02:47:13,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:13,896 INFO L93 Difference]: Finished difference Result 41608 states and 128455 transitions. [2019-12-27 02:47:13,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 02:47:13,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 02:47:13,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:13,937 INFO L225 Difference]: With dead ends: 41608 [2019-12-27 02:47:13,938 INFO L226 Difference]: Without dead ends: 28443 [2019-12-27 02:47:13,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:47:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28443 states. [2019-12-27 02:47:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28443 to 20934. [2019-12-27 02:47:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20934 states. [2019-12-27 02:47:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20934 states to 20934 states and 64596 transitions. [2019-12-27 02:47:14,645 INFO L78 Accepts]: Start accepts. Automaton has 20934 states and 64596 transitions. Word has length 66 [2019-12-27 02:47:14,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:14,645 INFO L462 AbstractCegarLoop]: Abstraction has 20934 states and 64596 transitions. [2019-12-27 02:47:14,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:47:14,645 INFO L276 IsEmpty]: Start isEmpty. Operand 20934 states and 64596 transitions. [2019-12-27 02:47:14,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:14,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:14,674 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] [2019-12-27 02:47:14,674 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:14,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:14,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1421968206, now seen corresponding path program 2 times [2019-12-27 02:47:14,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:14,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063617375] [2019-12-27 02:47:14,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:14,897 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 02:47:14,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063617375] [2019-12-27 02:47:14,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:14,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:47:14,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029647969] [2019-12-27 02:47:14,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:47:14,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:14,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:47:14,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:47:14,899 INFO L87 Difference]: Start difference. First operand 20934 states and 64596 transitions. Second operand 10 states. [2019-12-27 02:47:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:16,763 INFO L93 Difference]: Finished difference Result 36359 states and 111312 transitions. [2019-12-27 02:47:16,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:47:16,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 02:47:16,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:16,819 INFO L225 Difference]: With dead ends: 36359 [2019-12-27 02:47:16,819 INFO L226 Difference]: Without dead ends: 30399 [2019-12-27 02:47:16,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 02:47:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30399 states. [2019-12-27 02:47:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30399 to 21386. [2019-12-27 02:47:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21386 states. [2019-12-27 02:47:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21386 states to 21386 states and 65844 transitions. [2019-12-27 02:47:17,242 INFO L78 Accepts]: Start accepts. Automaton has 21386 states and 65844 transitions. Word has length 66 [2019-12-27 02:47:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:17,243 INFO L462 AbstractCegarLoop]: Abstraction has 21386 states and 65844 transitions. [2019-12-27 02:47:17,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:47:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 21386 states and 65844 transitions. [2019-12-27 02:47:17,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:17,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:17,264 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] [2019-12-27 02:47:17,264 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:17,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:17,264 INFO L82 PathProgramCache]: Analyzing trace with hash 765284024, now seen corresponding path program 3 times [2019-12-27 02:47:17,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:17,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024197669] [2019-12-27 02:47:17,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:17,446 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 02:47:17,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024197669] [2019-12-27 02:47:17,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:17,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:47:17,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944850726] [2019-12-27 02:47:17,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:47:17,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:17,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:47:17,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:47:17,451 INFO L87 Difference]: Start difference. First operand 21386 states and 65844 transitions. Second operand 11 states. [2019-12-27 02:47:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:19,457 INFO L93 Difference]: Finished difference Result 33042 states and 101402 transitions. [2019-12-27 02:47:19,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 02:47:19,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:47:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:19,500 INFO L225 Difference]: With dead ends: 33042 [2019-12-27 02:47:19,500 INFO L226 Difference]: Without dead ends: 29559 [2019-12-27 02:47:19,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-27 02:47:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29559 states. [2019-12-27 02:47:19,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29559 to 20954. [2019-12-27 02:47:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20954 states. [2019-12-27 02:47:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20954 states to 20954 states and 64512 transitions. [2019-12-27 02:47:20,324 INFO L78 Accepts]: Start accepts. Automaton has 20954 states and 64512 transitions. Word has length 66 [2019-12-27 02:47:20,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:20,324 INFO L462 AbstractCegarLoop]: Abstraction has 20954 states and 64512 transitions. [2019-12-27 02:47:20,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:47:20,324 INFO L276 IsEmpty]: Start isEmpty. Operand 20954 states and 64512 transitions. [2019-12-27 02:47:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:20,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:20,345 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] [2019-12-27 02:47:20,345 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:20,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:20,346 INFO L82 PathProgramCache]: Analyzing trace with hash 53330666, now seen corresponding path program 4 times [2019-12-27 02:47:20,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:20,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759975431] [2019-12-27 02:47:20,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:20,527 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 02:47:20,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759975431] [2019-12-27 02:47:20,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:20,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:47:20,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964851934] [2019-12-27 02:47:20,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:47:20,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:20,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:47:20,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:47:20,530 INFO L87 Difference]: Start difference. First operand 20954 states and 64512 transitions. Second operand 11 states. [2019-12-27 02:47:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:22,637 INFO L93 Difference]: Finished difference Result 34053 states and 104143 transitions. [2019-12-27 02:47:22,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 02:47:22,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:47:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:22,681 INFO L225 Difference]: With dead ends: 34053 [2019-12-27 02:47:22,681 INFO L226 Difference]: Without dead ends: 29681 [2019-12-27 02:47:22,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-27 02:47:22,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29681 states. [2019-12-27 02:47:23,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29681 to 21178. [2019-12-27 02:47:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21178 states. [2019-12-27 02:47:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21178 states to 21178 states and 65096 transitions. [2019-12-27 02:47:23,086 INFO L78 Accepts]: Start accepts. Automaton has 21178 states and 65096 transitions. Word has length 66 [2019-12-27 02:47:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:23,087 INFO L462 AbstractCegarLoop]: Abstraction has 21178 states and 65096 transitions. [2019-12-27 02:47:23,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:47:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 21178 states and 65096 transitions. [2019-12-27 02:47:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:23,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:23,110 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] [2019-12-27 02:47:23,110 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:23,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:23,110 INFO L82 PathProgramCache]: Analyzing trace with hash 791396238, now seen corresponding path program 5 times [2019-12-27 02:47:23,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:23,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074680805] [2019-12-27 02:47:23,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:23,409 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 02:47:23,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074680805] [2019-12-27 02:47:23,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:23,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 02:47:23,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829135110] [2019-12-27 02:47:23,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:47:23,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:23,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:47:23,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:47:23,411 INFO L87 Difference]: Start difference. First operand 21178 states and 65096 transitions. Second operand 12 states. [2019-12-27 02:47:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:27,841 INFO L93 Difference]: Finished difference Result 36788 states and 110118 transitions. [2019-12-27 02:47:27,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 02:47:27,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 02:47:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:27,892 INFO L225 Difference]: With dead ends: 36788 [2019-12-27 02:47:27,892 INFO L226 Difference]: Without dead ends: 36524 [2019-12-27 02:47:27,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=457, Invalid=2195, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 02:47:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36524 states. [2019-12-27 02:47:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36524 to 27393. [2019-12-27 02:47:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27393 states. [2019-12-27 02:47:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27393 states to 27393 states and 83545 transitions. [2019-12-27 02:47:28,729 INFO L78 Accepts]: Start accepts. Automaton has 27393 states and 83545 transitions. Word has length 66 [2019-12-27 02:47:28,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:28,729 INFO L462 AbstractCegarLoop]: Abstraction has 27393 states and 83545 transitions. [2019-12-27 02:47:28,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:47:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 27393 states and 83545 transitions. [2019-12-27 02:47:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:28,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:28,758 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] [2019-12-27 02:47:28,758 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:28,758 INFO L82 PathProgramCache]: Analyzing trace with hash 883991506, now seen corresponding path program 6 times [2019-12-27 02:47:28,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:28,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096077281] [2019-12-27 02:47:28,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:28,855 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 02:47:28,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096077281] [2019-12-27 02:47:28,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:28,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:47:28,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278858674] [2019-12-27 02:47:28,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:47:28,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:28,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:47:28,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:47:28,858 INFO L87 Difference]: Start difference. First operand 27393 states and 83545 transitions. Second operand 8 states. [2019-12-27 02:47:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:30,617 INFO L93 Difference]: Finished difference Result 39426 states and 117617 transitions. [2019-12-27 02:47:30,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 02:47:30,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 02:47:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:30,706 INFO L225 Difference]: With dead ends: 39426 [2019-12-27 02:47:30,706 INFO L226 Difference]: Without dead ends: 39326 [2019-12-27 02:47:30,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-12-27 02:47:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39326 states. [2019-12-27 02:47:31,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39326 to 29799. [2019-12-27 02:47:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29799 states. [2019-12-27 02:47:31,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29799 states to 29799 states and 90646 transitions. [2019-12-27 02:47:31,375 INFO L78 Accepts]: Start accepts. Automaton has 29799 states and 90646 transitions. Word has length 66 [2019-12-27 02:47:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:31,375 INFO L462 AbstractCegarLoop]: Abstraction has 29799 states and 90646 transitions. [2019-12-27 02:47:31,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:47:31,376 INFO L276 IsEmpty]: Start isEmpty. Operand 29799 states and 90646 transitions. [2019-12-27 02:47:31,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:31,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:31,405 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] [2019-12-27 02:47:31,405 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:31,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:31,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1390949788, now seen corresponding path program 7 times [2019-12-27 02:47:31,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:31,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093837544] [2019-12-27 02:47:31,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:31,587 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 02:47:31,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093837544] [2019-12-27 02:47:31,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:31,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:47:31,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626505260] [2019-12-27 02:47:31,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:47:31,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:31,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:47:31,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:47:31,590 INFO L87 Difference]: Start difference. First operand 29799 states and 90646 transitions. Second operand 11 states. [2019-12-27 02:47:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:34,325 INFO L93 Difference]: Finished difference Result 51844 states and 155474 transitions. [2019-12-27 02:47:34,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 02:47:34,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:47:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:34,389 INFO L225 Difference]: With dead ends: 51844 [2019-12-27 02:47:34,389 INFO L226 Difference]: Without dead ends: 45529 [2019-12-27 02:47:34,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:47:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45529 states. [2019-12-27 02:47:35,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45529 to 30001. [2019-12-27 02:47:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30001 states. [2019-12-27 02:47:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30001 states to 30001 states and 90865 transitions. [2019-12-27 02:47:35,362 INFO L78 Accepts]: Start accepts. Automaton has 30001 states and 90865 transitions. Word has length 66 [2019-12-27 02:47:35,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:35,362 INFO L462 AbstractCegarLoop]: Abstraction has 30001 states and 90865 transitions. [2019-12-27 02:47:35,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:47:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 30001 states and 90865 transitions. [2019-12-27 02:47:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:35,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:35,392 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] [2019-12-27 02:47:35,392 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:35,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:35,393 INFO L82 PathProgramCache]: Analyzing trace with hash -793831102, now seen corresponding path program 8 times [2019-12-27 02:47:35,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:35,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873661215] [2019-12-27 02:47:35,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:47:35,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873661215] [2019-12-27 02:47:35,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:35,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 02:47:35,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833875167] [2019-12-27 02:47:35,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:47:35,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:35,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:47:35,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:47:35,599 INFO L87 Difference]: Start difference. First operand 30001 states and 90865 transitions. Second operand 12 states. [2019-12-27 02:47:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:39,199 INFO L93 Difference]: Finished difference Result 37658 states and 112207 transitions. [2019-12-27 02:47:39,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 02:47:39,200 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 02:47:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:39,252 INFO L225 Difference]: With dead ends: 37658 [2019-12-27 02:47:39,252 INFO L226 Difference]: Without dead ends: 37530 [2019-12-27 02:47:39,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=334, Invalid=1736, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 02:47:39,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37530 states. [2019-12-27 02:47:39,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37530 to 26188. [2019-12-27 02:47:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26188 states. [2019-12-27 02:47:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26188 states to 26188 states and 79650 transitions. [2019-12-27 02:47:39,767 INFO L78 Accepts]: Start accepts. Automaton has 26188 states and 79650 transitions. Word has length 66 [2019-12-27 02:47:39,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:39,767 INFO L462 AbstractCegarLoop]: Abstraction has 26188 states and 79650 transitions. [2019-12-27 02:47:39,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:47:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 26188 states and 79650 transitions. [2019-12-27 02:47:39,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:39,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:39,796 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] [2019-12-27 02:47:39,796 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:39,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:39,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1833986216, now seen corresponding path program 9 times [2019-12-27 02:47:39,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:39,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433946027] [2019-12-27 02:47:39,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:39,954 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 02:47:39,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433946027] [2019-12-27 02:47:39,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:39,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:47:39,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106472192] [2019-12-27 02:47:39,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:47:39,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:39,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:47:39,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:47:39,957 INFO L87 Difference]: Start difference. First operand 26188 states and 79650 transitions. Second operand 12 states. [2019-12-27 02:47:42,098 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-27 02:47:42,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:42,387 INFO L93 Difference]: Finished difference Result 40023 states and 121103 transitions. [2019-12-27 02:47:42,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:47:42,387 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 02:47:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:42,440 INFO L225 Difference]: With dead ends: 40023 [2019-12-27 02:47:42,440 INFO L226 Difference]: Without dead ends: 37845 [2019-12-27 02:47:42,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-27 02:47:42,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37845 states. [2019-12-27 02:47:42,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37845 to 26057. [2019-12-27 02:47:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26057 states. [2019-12-27 02:47:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26057 states to 26057 states and 79300 transitions. [2019-12-27 02:47:42,969 INFO L78 Accepts]: Start accepts. Automaton has 26057 states and 79300 transitions. Word has length 66 [2019-12-27 02:47:42,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:42,970 INFO L462 AbstractCegarLoop]: Abstraction has 26057 states and 79300 transitions. [2019-12-27 02:47:42,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:47:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 26057 states and 79300 transitions. [2019-12-27 02:47:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:42,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:42,997 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] [2019-12-27 02:47:42,997 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:42,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:42,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1354348786, now seen corresponding path program 10 times [2019-12-27 02:47:42,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:42,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992941054] [2019-12-27 02:47:42,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:43,559 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 02:47:43,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992941054] [2019-12-27 02:47:43,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:43,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 02:47:43,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891811800] [2019-12-27 02:47:43,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 02:47:43,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:43,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 02:47:43,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:47:43,561 INFO L87 Difference]: Start difference. First operand 26057 states and 79300 transitions. Second operand 19 states. [2019-12-27 02:47:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:47,885 INFO L93 Difference]: Finished difference Result 28158 states and 85336 transitions. [2019-12-27 02:47:47,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 02:47:47,885 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-27 02:47:47,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:47,926 INFO L225 Difference]: With dead ends: 28158 [2019-12-27 02:47:47,926 INFO L226 Difference]: Without dead ends: 27401 [2019-12-27 02:47:47,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=249, Invalid=1557, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 02:47:48,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27401 states. [2019-12-27 02:47:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27401 to 26215. [2019-12-27 02:47:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26215 states. [2019-12-27 02:47:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26215 states to 26215 states and 79738 transitions. [2019-12-27 02:47:48,345 INFO L78 Accepts]: Start accepts. Automaton has 26215 states and 79738 transitions. Word has length 66 [2019-12-27 02:47:48,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:48,346 INFO L462 AbstractCegarLoop]: Abstraction has 26215 states and 79738 transitions. [2019-12-27 02:47:48,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 02:47:48,346 INFO L276 IsEmpty]: Start isEmpty. Operand 26215 states and 79738 transitions. [2019-12-27 02:47:48,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:48,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:48,372 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] [2019-12-27 02:47:48,372 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:48,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:48,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2052995732, now seen corresponding path program 11 times [2019-12-27 02:47:48,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:48,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922538255] [2019-12-27 02:47:48,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:49,170 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 02:47:49,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922538255] [2019-12-27 02:47:49,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:49,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 02:47:49,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21946061] [2019-12-27 02:47:49,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 02:47:49,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:49,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 02:47:49,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:47:49,175 INFO L87 Difference]: Start difference. First operand 26215 states and 79738 transitions. Second operand 19 states. [2019-12-27 02:47:53,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:53,821 INFO L93 Difference]: Finished difference Result 28570 states and 86456 transitions. [2019-12-27 02:47:53,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 02:47:53,821 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-27 02:47:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:53,860 INFO L225 Difference]: With dead ends: 28570 [2019-12-27 02:47:53,861 INFO L226 Difference]: Without dead ends: 27624 [2019-12-27 02:47:53,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=248, Invalid=1392, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 02:47:53,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27624 states. [2019-12-27 02:47:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27624 to 26219. [2019-12-27 02:47:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26219 states. [2019-12-27 02:47:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26219 states to 26219 states and 79739 transitions. [2019-12-27 02:47:54,276 INFO L78 Accepts]: Start accepts. Automaton has 26219 states and 79739 transitions. Word has length 66 [2019-12-27 02:47:54,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:54,276 INFO L462 AbstractCegarLoop]: Abstraction has 26219 states and 79739 transitions. [2019-12-27 02:47:54,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 02:47:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand 26219 states and 79739 transitions. [2019-12-27 02:47:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:47:54,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:54,303 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] [2019-12-27 02:47:54,303 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:54,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:54,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1401075272, now seen corresponding path program 12 times [2019-12-27 02:47:54,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:54,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231326237] [2019-12-27 02:47:54,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:54,370 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 02:47:54,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231326237] [2019-12-27 02:47:54,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:54,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:47:54,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001068003] [2019-12-27 02:47:54,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:47:54,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:54,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:47:54,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:47:54,372 INFO L87 Difference]: Start difference. First operand 26219 states and 79739 transitions. Second operand 3 states. [2019-12-27 02:47:54,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:47:54,462 INFO L93 Difference]: Finished difference Result 26219 states and 79738 transitions. [2019-12-27 02:47:54,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:47:54,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:47:54,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:47:54,499 INFO L225 Difference]: With dead ends: 26219 [2019-12-27 02:47:54,499 INFO L226 Difference]: Without dead ends: 26219 [2019-12-27 02:47:54,500 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 02:47:54,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26219 states. [2019-12-27 02:47:54,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26219 to 21918. [2019-12-27 02:47:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21918 states. [2019-12-27 02:47:54,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21918 states to 21918 states and 67338 transitions. [2019-12-27 02:47:54,890 INFO L78 Accepts]: Start accepts. Automaton has 21918 states and 67338 transitions. Word has length 66 [2019-12-27 02:47:54,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:47:54,891 INFO L462 AbstractCegarLoop]: Abstraction has 21918 states and 67338 transitions. [2019-12-27 02:47:54,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:47:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 21918 states and 67338 transitions. [2019-12-27 02:47:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:47:54,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:47:54,915 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] [2019-12-27 02:47:54,915 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:47:54,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:47:54,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1857250972, now seen corresponding path program 1 times [2019-12-27 02:47:54,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:47:54,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896309883] [2019-12-27 02:47:54,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:47:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:47:55,583 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 02:47:55,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896309883] [2019-12-27 02:47:55,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:47:55,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 02:47:55,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390724981] [2019-12-27 02:47:55,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 02:47:55,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:47:55,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 02:47:55,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:47:55,586 INFO L87 Difference]: Start difference. First operand 21918 states and 67338 transitions. Second operand 19 states. [2019-12-27 02:48:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:48:03,639 INFO L93 Difference]: Finished difference Result 33798 states and 103228 transitions. [2019-12-27 02:48:03,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 02:48:03,640 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 02:48:03,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:48:03,691 INFO L225 Difference]: With dead ends: 33798 [2019-12-27 02:48:03,692 INFO L226 Difference]: Without dead ends: 33175 [2019-12-27 02:48:03,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=534, Invalid=3498, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 02:48:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33175 states. [2019-12-27 02:48:04,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33175 to 22367. [2019-12-27 02:48:04,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22367 states. [2019-12-27 02:48:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22367 states to 22367 states and 68585 transitions. [2019-12-27 02:48:04,138 INFO L78 Accepts]: Start accepts. Automaton has 22367 states and 68585 transitions. Word has length 67 [2019-12-27 02:48:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:48:04,138 INFO L462 AbstractCegarLoop]: Abstraction has 22367 states and 68585 transitions. [2019-12-27 02:48:04,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 02:48:04,138 INFO L276 IsEmpty]: Start isEmpty. Operand 22367 states and 68585 transitions. [2019-12-27 02:48:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:48:04,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:48:04,163 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] [2019-12-27 02:48:04,164 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:48:04,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:48:04,164 INFO L82 PathProgramCache]: Analyzing trace with hash 2040469818, now seen corresponding path program 2 times [2019-12-27 02:48:04,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:48:04,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81319140] [2019-12-27 02:48:04,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:48:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:48:05,316 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 02:48:05,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81319140] [2019-12-27 02:48:05,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:48:05,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-27 02:48:05,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795588853] [2019-12-27 02:48:05,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 02:48:05,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:48:05,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 02:48:05,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2019-12-27 02:48:05,318 INFO L87 Difference]: Start difference. First operand 22367 states and 68585 transitions. Second operand 22 states. [2019-12-27 02:48:16,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:48:16,298 INFO L93 Difference]: Finished difference Result 35645 states and 106985 transitions. [2019-12-27 02:48:16,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-27 02:48:16,298 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-12-27 02:48:16,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:48:16,347 INFO L225 Difference]: With dead ends: 35645 [2019-12-27 02:48:16,347 INFO L226 Difference]: Without dead ends: 34851 [2019-12-27 02:48:16,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1706 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=936, Invalid=5544, Unknown=0, NotChecked=0, Total=6480 [2019-12-27 02:48:16,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34851 states. [2019-12-27 02:48:16,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34851 to 22041. [2019-12-27 02:48:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22041 states. [2019-12-27 02:48:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22041 states to 22041 states and 67660 transitions. [2019-12-27 02:48:16,805 INFO L78 Accepts]: Start accepts. Automaton has 22041 states and 67660 transitions. Word has length 67 [2019-12-27 02:48:16,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:48:16,805 INFO L462 AbstractCegarLoop]: Abstraction has 22041 states and 67660 transitions. [2019-12-27 02:48:16,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 02:48:16,805 INFO L276 IsEmpty]: Start isEmpty. Operand 22041 states and 67660 transitions. [2019-12-27 02:48:16,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:48:16,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:48:16,828 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] [2019-12-27 02:48:16,828 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:48:16,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:48:16,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1823504856, now seen corresponding path program 3 times [2019-12-27 02:48:16,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:48:16,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81005044] [2019-12-27 02:48:16,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:48:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:48:17,750 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 02:48:17,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81005044] [2019-12-27 02:48:17,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:48:17,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 02:48:17,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159056979] [2019-12-27 02:48:17,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 02:48:17,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:48:17,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 02:48:17,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-12-27 02:48:17,751 INFO L87 Difference]: Start difference. First operand 22041 states and 67660 transitions. Second operand 21 states. [2019-12-27 02:48:20,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:48:20,890 INFO L93 Difference]: Finished difference Result 24623 states and 74194 transitions. [2019-12-27 02:48:20,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 02:48:20,891 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-27 02:48:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:48:20,924 INFO L225 Difference]: With dead ends: 24623 [2019-12-27 02:48:20,924 INFO L226 Difference]: Without dead ends: 23757 [2019-12-27 02:48:20,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=218, Invalid=1422, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 02:48:21,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23757 states. [2019-12-27 02:48:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23757 to 22254. [2019-12-27 02:48:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-27 02:48:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 68033 transitions. [2019-12-27 02:48:21,602 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 68033 transitions. Word has length 67 [2019-12-27 02:48:21,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:48:21,602 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 68033 transitions. [2019-12-27 02:48:21,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 02:48:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 68033 transitions. [2019-12-27 02:48:21,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:48:21,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:48:21,625 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] [2019-12-27 02:48:21,625 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:48:21,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:48:21,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1175107444, now seen corresponding path program 4 times [2019-12-27 02:48:21,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:48:21,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224646973] [2019-12-27 02:48:21,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:48:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:48:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:48:21,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224646973] [2019-12-27 02:48:21,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:48:21,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:48:21,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936201975] [2019-12-27 02:48:21,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:48:21,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:48:21,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:48:21,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:48:21,824 INFO L87 Difference]: Start difference. First operand 22254 states and 68033 transitions. Second operand 12 states. [2019-12-27 02:48:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:48:24,204 INFO L93 Difference]: Finished difference Result 33231 states and 100827 transitions. [2019-12-27 02:48:24,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:48:24,205 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 02:48:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:48:24,250 INFO L225 Difference]: With dead ends: 33231 [2019-12-27 02:48:24,251 INFO L226 Difference]: Without dead ends: 32228 [2019-12-27 02:48:24,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:48:24,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32228 states. [2019-12-27 02:48:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32228 to 22060. [2019-12-27 02:48:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22060 states. [2019-12-27 02:48:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22060 states to 22060 states and 67528 transitions. [2019-12-27 02:48:24,687 INFO L78 Accepts]: Start accepts. Automaton has 22060 states and 67528 transitions. Word has length 67 [2019-12-27 02:48:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:48:24,687 INFO L462 AbstractCegarLoop]: Abstraction has 22060 states and 67528 transitions. [2019-12-27 02:48:24,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:48:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 22060 states and 67528 transitions. [2019-12-27 02:48:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:48:24,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:48:24,708 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] [2019-12-27 02:48:24,709 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:48:24,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:48:24,709 INFO L82 PathProgramCache]: Analyzing trace with hash -715209700, now seen corresponding path program 5 times [2019-12-27 02:48:24,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:48:24,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166038908] [2019-12-27 02:48:24,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:48:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:48:25,366 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 02:48:25,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166038908] [2019-12-27 02:48:25,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:48:25,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-27 02:48:25,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229894376] [2019-12-27 02:48:25,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 02:48:25,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:48:25,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 02:48:25,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-27 02:48:25,368 INFO L87 Difference]: Start difference. First operand 22060 states and 67528 transitions. Second operand 23 states. [2019-12-27 02:48:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:48:30,120 INFO L93 Difference]: Finished difference Result 26708 states and 80284 transitions. [2019-12-27 02:48:30,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 02:48:30,121 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-12-27 02:48:30,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:48:30,157 INFO L225 Difference]: With dead ends: 26708 [2019-12-27 02:48:30,157 INFO L226 Difference]: Without dead ends: 25841 [2019-12-27 02:48:30,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=409, Invalid=2243, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 02:48:30,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25841 states. [2019-12-27 02:48:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25841 to 22077. [2019-12-27 02:48:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22077 states. [2019-12-27 02:48:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22077 states to 22077 states and 67568 transitions. [2019-12-27 02:48:30,821 INFO L78 Accepts]: Start accepts. Automaton has 22077 states and 67568 transitions. Word has length 67 [2019-12-27 02:48:30,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:48:30,821 INFO L462 AbstractCegarLoop]: Abstraction has 22077 states and 67568 transitions. [2019-12-27 02:48:30,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 02:48:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 22077 states and 67568 transitions. [2019-12-27 02:48:30,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:48:30,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:48:30,842 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] [2019-12-27 02:48:30,843 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:48:30,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:48:30,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1738993652, now seen corresponding path program 6 times [2019-12-27 02:48:30,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:48:30,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902428060] [2019-12-27 02:48:30,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:48:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:48:31,229 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 02:48:31,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902428060] [2019-12-27 02:48:31,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:48:31,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 02:48:31,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320163804] [2019-12-27 02:48:31,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 02:48:31,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:48:31,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 02:48:31,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:48:31,231 INFO L87 Difference]: Start difference. First operand 22077 states and 67568 transitions. Second operand 19 states. [2019-12-27 02:48:33,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:48:33,208 INFO L93 Difference]: Finished difference Result 23419 states and 71074 transitions. [2019-12-27 02:48:33,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 02:48:33,208 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 02:48:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:48:33,241 INFO L225 Difference]: With dead ends: 23419 [2019-12-27 02:48:33,241 INFO L226 Difference]: Without dead ends: 22720 [2019-12-27 02:48:33,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2019-12-27 02:48:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22720 states. [2019-12-27 02:48:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22720 to 22149. [2019-12-27 02:48:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22149 states. [2019-12-27 02:48:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22149 states to 22149 states and 67762 transitions. [2019-12-27 02:48:33,586 INFO L78 Accepts]: Start accepts. Automaton has 22149 states and 67762 transitions. Word has length 67 [2019-12-27 02:48:33,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:48:33,586 INFO L462 AbstractCegarLoop]: Abstraction has 22149 states and 67762 transitions. [2019-12-27 02:48:33,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 02:48:33,586 INFO L276 IsEmpty]: Start isEmpty. Operand 22149 states and 67762 transitions. [2019-12-27 02:48:33,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:48:33,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:48:33,608 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] [2019-12-27 02:48:33,608 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:48:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:48:33,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1888249440, now seen corresponding path program 7 times [2019-12-27 02:48:33,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:48:33,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610187541] [2019-12-27 02:48:33,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:48:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:48:34,323 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 02:48:34,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610187541] [2019-12-27 02:48:34,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:48:34,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 02:48:34,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023623477] [2019-12-27 02:48:34,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 02:48:34,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:48:34,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 02:48:34,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-27 02:48:34,327 INFO L87 Difference]: Start difference. First operand 22149 states and 67762 transitions. Second operand 20 states. [2019-12-27 02:48:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:48:38,761 INFO L93 Difference]: Finished difference Result 24596 states and 74423 transitions. [2019-12-27 02:48:38,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 02:48:38,761 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-27 02:48:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:48:38,794 INFO L225 Difference]: With dead ends: 24596 [2019-12-27 02:48:38,794 INFO L226 Difference]: Without dead ends: 23476 [2019-12-27 02:48:38,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=260, Invalid=1720, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 02:48:38,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23476 states. [2019-12-27 02:48:39,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23476 to 22079. [2019-12-27 02:48:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22079 states. [2019-12-27 02:48:39,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22079 states to 22079 states and 67581 transitions. [2019-12-27 02:48:39,146 INFO L78 Accepts]: Start accepts. Automaton has 22079 states and 67581 transitions. Word has length 67 [2019-12-27 02:48:39,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:48:39,146 INFO L462 AbstractCegarLoop]: Abstraction has 22079 states and 67581 transitions. [2019-12-27 02:48:39,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 02:48:39,147 INFO L276 IsEmpty]: Start isEmpty. Operand 22079 states and 67581 transitions. [2019-12-27 02:48:39,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:48:39,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:48:39,168 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] [2019-12-27 02:48:39,168 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:48:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:48:39,169 INFO L82 PathProgramCache]: Analyzing trace with hash -259929662, now seen corresponding path program 8 times [2019-12-27 02:48:39,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:48:39,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638123641] [2019-12-27 02:48:39,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:48:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:48:40,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 02:48:40,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638123641] [2019-12-27 02:48:40,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:48:40,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 02:48:40,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466632862] [2019-12-27 02:48:40,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 02:48:40,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:48:40,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 02:48:40,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-12-27 02:48:40,016 INFO L87 Difference]: Start difference. First operand 22079 states and 67581 transitions. Second operand 20 states. [2019-12-27 02:48:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:48:44,277 INFO L93 Difference]: Finished difference Result 27049 states and 81904 transitions. [2019-12-27 02:48:44,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 02:48:44,277 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-27 02:48:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:48:44,314 INFO L225 Difference]: With dead ends: 27049 [2019-12-27 02:48:44,314 INFO L226 Difference]: Without dead ends: 25662 [2019-12-27 02:48:44,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=233, Invalid=1573, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 02:48:44,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25662 states. [2019-12-27 02:48:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25662 to 22161. [2019-12-27 02:48:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22161 states. [2019-12-27 02:48:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22161 states to 22161 states and 67779 transitions. [2019-12-27 02:48:44,701 INFO L78 Accepts]: Start accepts. Automaton has 22161 states and 67779 transitions. Word has length 67 [2019-12-27 02:48:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:48:44,701 INFO L462 AbstractCegarLoop]: Abstraction has 22161 states and 67779 transitions. [2019-12-27 02:48:44,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 02:48:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 22161 states and 67779 transitions. [2019-12-27 02:48:44,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:48:44,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:48:44,725 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] [2019-12-27 02:48:44,725 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:48:44,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:48:44,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2019491720, now seen corresponding path program 9 times [2019-12-27 02:48:44,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:48:44,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181845592] [2019-12-27 02:48:44,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:48:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:48:45,769 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 02:48:45,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181845592] [2019-12-27 02:48:45,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:48:45,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 02:48:45,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244914255] [2019-12-27 02:48:45,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 02:48:45,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:48:45,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 02:48:45,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:48:45,771 INFO L87 Difference]: Start difference. First operand 22161 states and 67779 transitions. Second operand 19 states. [2019-12-27 02:48:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:48:55,751 INFO L93 Difference]: Finished difference Result 37555 states and 115500 transitions. [2019-12-27 02:48:55,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-12-27 02:48:55,752 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 02:48:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:48:55,796 INFO L225 Difference]: With dead ends: 37555 [2019-12-27 02:48:55,796 INFO L226 Difference]: Without dead ends: 31838 [2019-12-27 02:48:55,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2159 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1044, Invalid=5928, Unknown=0, NotChecked=0, Total=6972 [2019-12-27 02:48:55,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31838 states. [2019-12-27 02:48:56,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31838 to 25337. [2019-12-27 02:48:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25337 states. [2019-12-27 02:48:56,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25337 states to 25337 states and 77916 transitions. [2019-12-27 02:48:56,255 INFO L78 Accepts]: Start accepts. Automaton has 25337 states and 77916 transitions. Word has length 67 [2019-12-27 02:48:56,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:48:56,256 INFO L462 AbstractCegarLoop]: Abstraction has 25337 states and 77916 transitions. [2019-12-27 02:48:56,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 02:48:56,256 INFO L276 IsEmpty]: Start isEmpty. Operand 25337 states and 77916 transitions. [2019-12-27 02:48:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:48:56,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:48:56,285 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] [2019-12-27 02:48:56,285 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:48:56,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:48:56,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1367966008, now seen corresponding path program 10 times [2019-12-27 02:48:56,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:48:56,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280088386] [2019-12-27 02:48:56,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:48:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:48:56,855 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 02:48:56,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280088386] [2019-12-27 02:48:56,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:48:56,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 02:48:56,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513931801] [2019-12-27 02:48:56,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 02:48:56,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:48:56,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 02:48:56,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:48:56,856 INFO L87 Difference]: Start difference. First operand 25337 states and 77916 transitions. Second operand 15 states. [2019-12-27 02:49:03,618 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-12-27 02:49:04,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:49:04,730 INFO L93 Difference]: Finished difference Result 68894 states and 207695 transitions. [2019-12-27 02:49:04,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-12-27 02:49:04,730 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 02:49:04,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:49:04,793 INFO L225 Difference]: With dead ends: 68894 [2019-12-27 02:49:04,793 INFO L226 Difference]: Without dead ends: 45439 [2019-12-27 02:49:04,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2373 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1079, Invalid=5893, Unknown=0, NotChecked=0, Total=6972 [2019-12-27 02:49:04,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45439 states. [2019-12-27 02:49:05,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45439 to 24407. [2019-12-27 02:49:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24407 states. [2019-12-27 02:49:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24407 states to 24407 states and 74674 transitions. [2019-12-27 02:49:05,360 INFO L78 Accepts]: Start accepts. Automaton has 24407 states and 74674 transitions. Word has length 67 [2019-12-27 02:49:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:49:05,360 INFO L462 AbstractCegarLoop]: Abstraction has 24407 states and 74674 transitions. [2019-12-27 02:49:05,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 02:49:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 24407 states and 74674 transitions. [2019-12-27 02:49:05,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:49:05,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:49:05,388 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] [2019-12-27 02:49:05,389 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:49:05,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:49:05,389 INFO L82 PathProgramCache]: Analyzing trace with hash 201130856, now seen corresponding path program 11 times [2019-12-27 02:49:05,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:49:05,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490152665] [2019-12-27 02:49:05,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:49:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:49:06,295 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 02:49:06,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490152665] [2019-12-27 02:49:06,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:49:06,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-27 02:49:06,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307843261] [2019-12-27 02:49:06,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 02:49:06,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:49:06,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 02:49:06,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2019-12-27 02:49:06,296 INFO L87 Difference]: Start difference. First operand 24407 states and 74674 transitions. Second operand 24 states. [2019-12-27 02:49:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:49:12,116 INFO L93 Difference]: Finished difference Result 27172 states and 82799 transitions. [2019-12-27 02:49:12,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 02:49:12,116 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-12-27 02:49:12,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:49:12,156 INFO L225 Difference]: With dead ends: 27172 [2019-12-27 02:49:12,156 INFO L226 Difference]: Without dead ends: 26503 [2019-12-27 02:49:12,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=304, Invalid=2146, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 02:49:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26503 states. [2019-12-27 02:49:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26503 to 24597. [2019-12-27 02:49:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24597 states. [2019-12-27 02:49:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24597 states to 24597 states and 75138 transitions. [2019-12-27 02:49:12,562 INFO L78 Accepts]: Start accepts. Automaton has 24597 states and 75138 transitions. Word has length 67 [2019-12-27 02:49:12,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:49:12,562 INFO L462 AbstractCegarLoop]: Abstraction has 24597 states and 75138 transitions. [2019-12-27 02:49:12,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 02:49:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 24597 states and 75138 transitions. [2019-12-27 02:49:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:49:12,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:49:12,592 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] [2019-12-27 02:49:12,592 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:49:12,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:49:12,592 INFO L82 PathProgramCache]: Analyzing trace with hash 384349702, now seen corresponding path program 12 times [2019-12-27 02:49:12,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:49:12,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111304216] [2019-12-27 02:49:12,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:49:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:49:13,359 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 02:49:13,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111304216] [2019-12-27 02:49:13,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:49:13,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-27 02:49:13,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071593443] [2019-12-27 02:49:13,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 02:49:13,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:49:13,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 02:49:13,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2019-12-27 02:49:13,361 INFO L87 Difference]: Start difference. First operand 24597 states and 75138 transitions. Second operand 22 states. [2019-12-27 02:49:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:49:16,427 INFO L93 Difference]: Finished difference Result 27002 states and 81387 transitions. [2019-12-27 02:49:16,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 02:49:16,428 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-12-27 02:49:16,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:49:16,466 INFO L225 Difference]: With dead ends: 27002 [2019-12-27 02:49:16,467 INFO L226 Difference]: Without dead ends: 25912 [2019-12-27 02:49:16,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=207, Invalid=1433, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 02:49:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25912 states. [2019-12-27 02:49:16,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25912 to 24968. [2019-12-27 02:49:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24968 states. [2019-12-27 02:49:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24968 states to 24968 states and 76173 transitions. [2019-12-27 02:49:16,873 INFO L78 Accepts]: Start accepts. Automaton has 24968 states and 76173 transitions. Word has length 67 [2019-12-27 02:49:16,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:49:16,873 INFO L462 AbstractCegarLoop]: Abstraction has 24968 states and 76173 transitions. [2019-12-27 02:49:16,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 02:49:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 24968 states and 76173 transitions. [2019-12-27 02:49:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:49:16,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:49:16,900 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] [2019-12-27 02:49:16,900 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:49:16,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:49:16,901 INFO L82 PathProgramCache]: Analyzing trace with hash 238573156, now seen corresponding path program 13 times [2019-12-27 02:49:16,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:49:16,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143972388] [2019-12-27 02:49:16,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:49:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:49:17,542 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 02:49:17,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143972388] [2019-12-27 02:49:17,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:49:17,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-27 02:49:17,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442552319] [2019-12-27 02:49:17,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 02:49:17,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:49:17,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 02:49:17,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-27 02:49:17,546 INFO L87 Difference]: Start difference. First operand 24968 states and 76173 transitions. Second operand 23 states. [2019-12-27 02:49:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:49:22,631 INFO L93 Difference]: Finished difference Result 28233 states and 85387 transitions. [2019-12-27 02:49:22,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 02:49:22,631 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-12-27 02:49:22,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:49:22,671 INFO L225 Difference]: With dead ends: 28233 [2019-12-27 02:49:22,671 INFO L226 Difference]: Without dead ends: 27796 [2019-12-27 02:49:22,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=379, Invalid=1877, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 02:49:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27796 states. [2019-12-27 02:49:23,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27796 to 24735. [2019-12-27 02:49:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24735 states. [2019-12-27 02:49:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24735 states to 24735 states and 75593 transitions. [2019-12-27 02:49:23,079 INFO L78 Accepts]: Start accepts. Automaton has 24735 states and 75593 transitions. Word has length 67 [2019-12-27 02:49:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:49:23,079 INFO L462 AbstractCegarLoop]: Abstraction has 24735 states and 75593 transitions. [2019-12-27 02:49:23,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 02:49:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 24735 states and 75593 transitions. [2019-12-27 02:49:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:49:23,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:49:23,105 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] [2019-12-27 02:49:23,106 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:49:23,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:49:23,106 INFO L82 PathProgramCache]: Analyzing trace with hash -873504790, now seen corresponding path program 14 times [2019-12-27 02:49:23,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:49:23,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569504245] [2019-12-27 02:49:23,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:49:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:49:23,626 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-12-27 02:49:24,722 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 02:49:24,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569504245] [2019-12-27 02:49:24,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:49:24,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-27 02:49:24,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195280699] [2019-12-27 02:49:24,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 02:49:24,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:49:24,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 02:49:24,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2019-12-27 02:49:24,724 INFO L87 Difference]: Start difference. First operand 24735 states and 75593 transitions. Second operand 24 states. [2019-12-27 02:49:34,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:49:34,964 INFO L93 Difference]: Finished difference Result 33330 states and 101858 transitions. [2019-12-27 02:49:34,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 02:49:34,964 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-12-27 02:49:34,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:49:35,012 INFO L225 Difference]: With dead ends: 33330 [2019-12-27 02:49:35,012 INFO L226 Difference]: Without dead ends: 32661 [2019-12-27 02:49:35,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=471, Invalid=3951, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 02:49:35,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32661 states. [2019-12-27 02:49:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32661 to 25200. [2019-12-27 02:49:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25200 states. [2019-12-27 02:49:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25200 states to 25200 states and 76865 transitions. [2019-12-27 02:49:35,468 INFO L78 Accepts]: Start accepts. Automaton has 25200 states and 76865 transitions. Word has length 67 [2019-12-27 02:49:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:49:35,468 INFO L462 AbstractCegarLoop]: Abstraction has 25200 states and 76865 transitions. [2019-12-27 02:49:35,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 02:49:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 25200 states and 76865 transitions. [2019-12-27 02:49:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:49:35,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:49:35,494 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] [2019-12-27 02:49:35,494 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:49:35,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:49:35,494 INFO L82 PathProgramCache]: Analyzing trace with hash -690285944, now seen corresponding path program 15 times [2019-12-27 02:49:35,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:49:35,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927914697] [2019-12-27 02:49:35,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:49:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:49:35,672 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 02:49:35,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927914697] [2019-12-27 02:49:35,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:49:35,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:49:35,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145027211] [2019-12-27 02:49:35,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:49:35,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:49:35,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:49:35,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:49:35,674 INFO L87 Difference]: Start difference. First operand 25200 states and 76865 transitions. Second operand 12 states. Received shutdown request... [2019-12-27 02:49:37,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 02:49:37,116 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 02:49:37,120 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 02:49:37,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:49:37 BasicIcfg [2019-12-27 02:49:37,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:49:37,122 INFO L168 Benchmark]: Toolchain (without parser) took 227607.00 ms. Allocated memory was 140.5 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.8 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 860.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:49:37,122 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 140.5 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 02:49:37,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.40 ms. Allocated memory was 140.5 MB in the beginning and 201.3 MB in the end (delta: 60.8 MB). Free memory was 100.3 MB in the beginning and 154.3 MB in the end (delta: -54.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:49:37,123 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.86 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:49:37,128 INFO L168 Benchmark]: Boogie Preprocessor took 47.08 ms. Allocated memory is still 201.3 MB. Free memory was 151.6 MB in the beginning and 149.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:49:37,128 INFO L168 Benchmark]: RCFGBuilder took 912.27 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 98.8 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:49:37,129 INFO L168 Benchmark]: TraceAbstraction took 225776.09 ms. Allocated memory was 201.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 98.8 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 798.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:49:37,131 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.40 ms. Allocated memory is still 140.5 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.40 ms. Allocated memory was 140.5 MB in the beginning and 201.3 MB in the end (delta: 60.8 MB). Free memory was 100.3 MB in the beginning and 154.3 MB in the end (delta: -54.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.86 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.08 ms. Allocated memory is still 201.3 MB. Free memory was 151.6 MB in the beginning and 149.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 912.27 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 98.8 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 225776.09 ms. Allocated memory was 201.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 98.8 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 798.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (25200states) and FLOYD_HOARE automaton (currently 22 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (9609 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (25200states) and FLOYD_HOARE automaton (currently 22 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (9609 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: TIMEOUT, OverallTime: 225.5s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 131.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11294 SDtfs, 16686 SDslu, 65518 SDs, 0 SdLazy, 95582 SolverSat, 1361 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 77.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1286 GetRequests, 101 SyntacticMatches, 54 SemanticMatches, 1131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13313 ImplicationChecksByTransitivity, 33.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 47.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 262015 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.3s InterpolantComputationTime, 2173 NumberOfCodeBlocks, 2173 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2133 ConstructedInterpolants, 0 QuantifiedInterpolants, 1130875 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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