/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe028_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:06:45,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:06:45,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:06:45,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:06:45,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:06:45,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:06:45,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:06:45,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:06:45,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:06:45,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:06:45,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:06:45,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:06:45,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:06:45,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:06:45,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:06:45,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:06:45,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:06:45,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:06:45,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:06:45,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:06:45,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:06:45,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:06:45,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:06:45,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:06:45,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:06:45,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:06:45,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:06:45,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:06:45,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:06:45,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:06:45,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:06:45,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:06:45,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:06:45,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:06:45,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:06:45,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:06:45,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:06:45,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:06:45,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:06:45,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:06:45,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:06:45,092 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:06:45,127 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:06:45,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:06:45,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:06:45,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:06:45,133 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:06:45,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:06:45,133 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:06:45,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:06:45,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:06:45,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:06:45,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:06:45,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:06:45,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:06:45,135 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:06:45,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:06:45,135 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:06:45,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:06:45,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:06:45,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:06:45,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:06:45,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:06:45,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:06:45,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:06:45,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:06:45,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:06:45,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:06:45,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:06:45,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:06:45,141 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:06:45,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:06:45,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:06:45,442 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:06:45,445 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:06:45,447 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:06:45,447 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:06:45,448 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe028_rmo.opt.i [2019-12-18 15:06:45,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5ddd64b/7c55b4461a874cf193b20d778dc799a3/FLAGfdd1bf4f4 [2019-12-18 15:06:45,968 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:06:45,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_rmo.opt.i [2019-12-18 15:06:45,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5ddd64b/7c55b4461a874cf193b20d778dc799a3/FLAGfdd1bf4f4 [2019-12-18 15:06:46,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5ddd64b/7c55b4461a874cf193b20d778dc799a3 [2019-12-18 15:06:46,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:06:46,261 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:06:46,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:06:46,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:06:46,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:06:46,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:06:46" (1/1) ... [2019-12-18 15:06:46,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d4d4379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:06:46, skipping insertion in model container [2019-12-18 15:06:46,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:06:46" (1/1) ... [2019-12-18 15:06:46,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:06:46,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:06:46,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:06:46,997 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:06:47,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:06:47,167 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:06:47,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:06:47 WrapperNode [2019-12-18 15:06:47,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:06:47,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:06:47,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:06:47,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:06:47,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:06:47" (1/1) ... [2019-12-18 15:06:47,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:06:47" (1/1) ... [2019-12-18 15:06:47,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:06:47,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:06:47,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:06:47,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:06:47,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:06:47" (1/1) ... [2019-12-18 15:06:47,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:06:47" (1/1) ... [2019-12-18 15:06:47,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:06:47" (1/1) ... [2019-12-18 15:06:47,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:06:47" (1/1) ... [2019-12-18 15:06:47,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:06:47" (1/1) ... [2019-12-18 15:06:47,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:06:47" (1/1) ... [2019-12-18 15:06:47,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:06:47" (1/1) ... [2019-12-18 15:06:47,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:06:47,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:06:47,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:06:47,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:06:47,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:06:47" (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-18 15:06:47,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 15:06:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:06:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:06:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:06:47,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:06:47,375 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:06:47,375 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:06:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:06:47,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:06:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 15:06:47,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 15:06:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 15:06:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:06:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:06:47,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:06:47,381 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:06:48,350 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:06:48,350 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-18 15:06:48,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:06:48 BoogieIcfgContainer [2019-12-18 15:06:48,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:06:48,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:06:48,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:06:48,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:06:48,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:06:46" (1/3) ... [2019-12-18 15:06:48,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31995450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:06:48, skipping insertion in model container [2019-12-18 15:06:48,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:06:47" (2/3) ... [2019-12-18 15:06:48,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31995450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:06:48, skipping insertion in model container [2019-12-18 15:06:48,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:06:48" (3/3) ... [2019-12-18 15:06:48,363 INFO L109 eAbstractionObserver]: Analyzing ICFG safe028_rmo.opt.i [2019-12-18 15:06:48,376 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:06:48,377 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:06:48,389 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 15:06:48,390 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:06:48,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,468 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,468 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,500 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,501 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,508 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,508 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,535 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,537 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,542 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,543 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,548 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,550 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:06:48,568 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-18 15:06:48,589 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:06:48,589 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:06:48,589 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:06:48,589 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:06:48,590 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:06:48,590 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:06:48,590 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:06:48,590 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:06:48,608 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 276 transitions [2019-12-18 15:06:48,610 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 223 places, 276 transitions [2019-12-18 15:06:48,737 INFO L126 PetriNetUnfolder]: 63/273 cut-off events. [2019-12-18 15:06:48,738 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:06:48,769 INFO L76 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 273 events. 63/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 646 event pairs. 9/218 useless extension candidates. Maximal degree in co-relation 225. Up to 2 conditions per place. [2019-12-18 15:06:48,814 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 223 places, 276 transitions [2019-12-18 15:06:48,891 INFO L126 PetriNetUnfolder]: 63/273 cut-off events. [2019-12-18 15:06:48,892 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:06:48,942 INFO L76 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 273 events. 63/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 646 event pairs. 9/218 useless extension candidates. Maximal degree in co-relation 225. Up to 2 conditions per place. [2019-12-18 15:06:48,975 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 32976 [2019-12-18 15:06:48,976 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:06:55,042 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-12-18 15:06:55,188 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-18 15:06:55,852 WARN L192 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 132 [2019-12-18 15:06:56,107 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-12-18 15:06:56,159 INFO L206 etLargeBlockEncoding]: Checked pairs total: 183707 [2019-12-18 15:06:56,159 INFO L214 etLargeBlockEncoding]: Total number of compositions: 146 [2019-12-18 15:06:56,162 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 117 places, 138 transitions [2019-12-18 15:08:30,894 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 300418 states. [2019-12-18 15:08:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 300418 states. [2019-12-18 15:08:30,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:08:30,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:30,962 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:30,962 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:30,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:30,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2075695311, now seen corresponding path program 1 times [2019-12-18 15:08:30,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:30,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275974466] [2019-12-18 15:08:30,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:31,367 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-18 15:08:31,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275974466] [2019-12-18 15:08:31,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:31,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:08:31,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834061477] [2019-12-18 15:08:31,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:08:31,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:31,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:08:31,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:08:31,390 INFO L87 Difference]: Start difference. First operand 300418 states. Second operand 4 states. [2019-12-18 15:08:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:36,576 INFO L93 Difference]: Finished difference Result 73618 states and 281612 transitions. [2019-12-18 15:08:36,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:08:36,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 15:08:36,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:36,938 INFO L225 Difference]: With dead ends: 73618 [2019-12-18 15:08:36,938 INFO L226 Difference]: Without dead ends: 52546 [2019-12-18 15:08:36,940 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-18 15:08:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52546 states. [2019-12-18 15:08:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52546 to 52546. [2019-12-18 15:08:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52546 states. [2019-12-18 15:08:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52546 states to 52546 states and 190000 transitions. [2019-12-18 15:08:39,144 INFO L78 Accepts]: Start accepts. Automaton has 52546 states and 190000 transitions. Word has length 17 [2019-12-18 15:08:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:39,145 INFO L462 AbstractCegarLoop]: Abstraction has 52546 states and 190000 transitions. [2019-12-18 15:08:39,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:08:39,145 INFO L276 IsEmpty]: Start isEmpty. Operand 52546 states and 190000 transitions. [2019-12-18 15:08:39,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:08:39,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:39,181 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-18 15:08:39,182 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:39,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:39,182 INFO L82 PathProgramCache]: Analyzing trace with hash -583825164, now seen corresponding path program 1 times [2019-12-18 15:08:39,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:39,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057102424] [2019-12-18 15:08:39,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:39,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-18 15:08:39,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057102424] [2019-12-18 15:08:39,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:39,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:39,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755887308] [2019-12-18 15:08:39,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:39,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:39,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:39,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:39,374 INFO L87 Difference]: Start difference. First operand 52546 states and 190000 transitions. Second operand 3 states. [2019-12-18 15:08:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:39,859 INFO L93 Difference]: Finished difference Result 49978 states and 178400 transitions. [2019-12-18 15:08:39,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:39,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 15:08:39,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:40,883 INFO L225 Difference]: With dead ends: 49978 [2019-12-18 15:08:40,883 INFO L226 Difference]: Without dead ends: 49978 [2019-12-18 15:08:40,888 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-18 15:08:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49978 states. [2019-12-18 15:08:42,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49978 to 49978. [2019-12-18 15:08:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49978 states. [2019-12-18 15:08:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49978 states to 49978 states and 178400 transitions. [2019-12-18 15:08:42,484 INFO L78 Accepts]: Start accepts. Automaton has 49978 states and 178400 transitions. Word has length 27 [2019-12-18 15:08:42,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:42,484 INFO L462 AbstractCegarLoop]: Abstraction has 49978 states and 178400 transitions. [2019-12-18 15:08:42,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 49978 states and 178400 transitions. [2019-12-18 15:08:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 15:08:42,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:42,509 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] [2019-12-18 15:08:42,509 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:42,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:42,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1333969975, now seen corresponding path program 1 times [2019-12-18 15:08:42,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:42,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611547298] [2019-12-18 15:08:42,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:42,658 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-18 15:08:42,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611547298] [2019-12-18 15:08:42,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:42,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:08:42,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945499569] [2019-12-18 15:08:42,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:08:42,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:42,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:08:42,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:08:42,661 INFO L87 Difference]: Start difference. First operand 49978 states and 178400 transitions. Second operand 4 states. [2019-12-18 15:08:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:43,280 INFO L93 Difference]: Finished difference Result 67250 states and 231265 transitions. [2019-12-18 15:08:43,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:08:43,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 15:08:43,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:43,455 INFO L225 Difference]: With dead ends: 67250 [2019-12-18 15:08:43,455 INFO L226 Difference]: Without dead ends: 67250 [2019-12-18 15:08:43,455 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-18 15:08:44,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67250 states. [2019-12-18 15:08:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67250 to 64766. [2019-12-18 15:08:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64766 states. [2019-12-18 15:08:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64766 states to 64766 states and 224064 transitions. [2019-12-18 15:08:46,171 INFO L78 Accepts]: Start accepts. Automaton has 64766 states and 224064 transitions. Word has length 28 [2019-12-18 15:08:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:46,172 INFO L462 AbstractCegarLoop]: Abstraction has 64766 states and 224064 transitions. [2019-12-18 15:08:46,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:08:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 64766 states and 224064 transitions. [2019-12-18 15:08:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 15:08:46,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:46,197 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] [2019-12-18 15:08:46,197 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:46,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:46,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1493897438, now seen corresponding path program 1 times [2019-12-18 15:08:46,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:46,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955444943] [2019-12-18 15:08:46,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:46,349 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-18 15:08:46,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955444943] [2019-12-18 15:08:46,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:46,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:08:46,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526209030] [2019-12-18 15:08:46,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:08:46,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:46,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:08:46,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:08:46,353 INFO L87 Difference]: Start difference. First operand 64766 states and 224064 transitions. Second operand 5 states. [2019-12-18 15:08:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:46,607 INFO L93 Difference]: Finished difference Result 28910 states and 94646 transitions. [2019-12-18 15:08:46,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:08:46,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 15:08:46,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:46,666 INFO L225 Difference]: With dead ends: 28910 [2019-12-18 15:08:46,666 INFO L226 Difference]: Without dead ends: 25265 [2019-12-18 15:08:46,667 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-18 15:08:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25265 states. [2019-12-18 15:08:47,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25265 to 25175. [2019-12-18 15:08:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25175 states. [2019-12-18 15:08:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25175 states to 25175 states and 82371 transitions. [2019-12-18 15:08:48,132 INFO L78 Accepts]: Start accepts. Automaton has 25175 states and 82371 transitions. Word has length 29 [2019-12-18 15:08:48,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:48,132 INFO L462 AbstractCegarLoop]: Abstraction has 25175 states and 82371 transitions. [2019-12-18 15:08:48,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:08:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 25175 states and 82371 transitions. [2019-12-18 15:08:48,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 15:08:48,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:48,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] [2019-12-18 15:08:48,168 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:48,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:48,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1164695851, now seen corresponding path program 1 times [2019-12-18 15:08:48,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:48,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760067920] [2019-12-18 15:08:48,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:48,251 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-18 15:08:48,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760067920] [2019-12-18 15:08:48,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:48,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:48,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544472591] [2019-12-18 15:08:48,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:48,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:48,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:48,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:48,253 INFO L87 Difference]: Start difference. First operand 25175 states and 82371 transitions. Second operand 3 states. [2019-12-18 15:08:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:48,357 INFO L93 Difference]: Finished difference Result 25175 states and 82283 transitions. [2019-12-18 15:08:48,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:48,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 15:08:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:48,400 INFO L225 Difference]: With dead ends: 25175 [2019-12-18 15:08:48,400 INFO L226 Difference]: Without dead ends: 25175 [2019-12-18 15:08:48,401 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-18 15:08:48,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25175 states. [2019-12-18 15:08:48,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25175 to 24326. [2019-12-18 15:08:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24326 states. [2019-12-18 15:08:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24326 states to 24326 states and 79932 transitions. [2019-12-18 15:08:48,980 INFO L78 Accepts]: Start accepts. Automaton has 24326 states and 79932 transitions. Word has length 44 [2019-12-18 15:08:48,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:48,981 INFO L462 AbstractCegarLoop]: Abstraction has 24326 states and 79932 transitions. [2019-12-18 15:08:48,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:48,981 INFO L276 IsEmpty]: Start isEmpty. Operand 24326 states and 79932 transitions. [2019-12-18 15:08:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 15:08:49,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:49,014 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] [2019-12-18 15:08:49,014 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:49,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:49,015 INFO L82 PathProgramCache]: Analyzing trace with hash -541366890, now seen corresponding path program 1 times [2019-12-18 15:08:49,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:49,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988221383] [2019-12-18 15:08:49,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:49,182 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-18 15:08:49,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988221383] [2019-12-18 15:08:49,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:49,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:08:49,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329375634] [2019-12-18 15:08:49,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:08:49,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:49,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:08:49,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:08:49,186 INFO L87 Difference]: Start difference. First operand 24326 states and 79932 transitions. Second operand 6 states. [2019-12-18 15:08:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:49,372 INFO L93 Difference]: Finished difference Result 22997 states and 76777 transitions. [2019-12-18 15:08:49,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:08:49,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-18 15:08:49,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:49,424 INFO L225 Difference]: With dead ends: 22997 [2019-12-18 15:08:49,425 INFO L226 Difference]: Without dead ends: 22857 [2019-12-18 15:08:49,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:08:49,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22857 states. [2019-12-18 15:08:49,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22857 to 22857. [2019-12-18 15:08:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22857 states. [2019-12-18 15:08:49,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22857 states to 22857 states and 76464 transitions. [2019-12-18 15:08:49,920 INFO L78 Accepts]: Start accepts. Automaton has 22857 states and 76464 transitions. Word has length 45 [2019-12-18 15:08:49,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:49,920 INFO L462 AbstractCegarLoop]: Abstraction has 22857 states and 76464 transitions. [2019-12-18 15:08:49,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:08:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 22857 states and 76464 transitions. [2019-12-18 15:08:49,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 15:08:49,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:49,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:49,948 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:49,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:49,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1488532936, now seen corresponding path program 1 times [2019-12-18 15:08:49,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:49,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696664878] [2019-12-18 15:08:49,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:50,037 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-18 15:08:50,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696664878] [2019-12-18 15:08:50,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:50,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:50,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141401419] [2019-12-18 15:08:50,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:50,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:50,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:50,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:50,040 INFO L87 Difference]: Start difference. First operand 22857 states and 76464 transitions. Second operand 3 states. [2019-12-18 15:08:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:50,175 INFO L93 Difference]: Finished difference Result 22323 states and 74339 transitions. [2019-12-18 15:08:50,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:50,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-18 15:08:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:50,234 INFO L225 Difference]: With dead ends: 22323 [2019-12-18 15:08:50,234 INFO L226 Difference]: Without dead ends: 22323 [2019-12-18 15:08:50,235 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-18 15:08:50,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22323 states. [2019-12-18 15:08:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22323 to 21879. [2019-12-18 15:08:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21879 states. [2019-12-18 15:08:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21879 states to 21879 states and 73073 transitions. [2019-12-18 15:08:51,326 INFO L78 Accepts]: Start accepts. Automaton has 21879 states and 73073 transitions. Word has length 70 [2019-12-18 15:08:51,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:51,326 INFO L462 AbstractCegarLoop]: Abstraction has 21879 states and 73073 transitions. [2019-12-18 15:08:51,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 21879 states and 73073 transitions. [2019-12-18 15:08:51,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 15:08:51,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:51,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:51,367 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:51,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:51,367 INFO L82 PathProgramCache]: Analyzing trace with hash 726610784, now seen corresponding path program 1 times [2019-12-18 15:08:51,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:51,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536408834] [2019-12-18 15:08:51,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:51,480 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-18 15:08:51,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536408834] [2019-12-18 15:08:51,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:51,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:08:51,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410496448] [2019-12-18 15:08:51,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:51,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:51,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:51,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:51,483 INFO L87 Difference]: Start difference. First operand 21879 states and 73073 transitions. Second operand 3 states. [2019-12-18 15:08:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:51,604 INFO L93 Difference]: Finished difference Result 21878 states and 73071 transitions. [2019-12-18 15:08:51,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:51,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-18 15:08:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:51,651 INFO L225 Difference]: With dead ends: 21878 [2019-12-18 15:08:51,651 INFO L226 Difference]: Without dead ends: 21878 [2019-12-18 15:08:51,652 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-18 15:08:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21878 states. [2019-12-18 15:08:52,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21878 to 21878. [2019-12-18 15:08:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21878 states. [2019-12-18 15:08:52,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21878 states to 21878 states and 73071 transitions. [2019-12-18 15:08:52,094 INFO L78 Accepts]: Start accepts. Automaton has 21878 states and 73071 transitions. Word has length 71 [2019-12-18 15:08:52,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:52,095 INFO L462 AbstractCegarLoop]: Abstraction has 21878 states and 73071 transitions. [2019-12-18 15:08:52,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 21878 states and 73071 transitions. [2019-12-18 15:08:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:08:52,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:52,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:52,135 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:52,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:52,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1049534817, now seen corresponding path program 1 times [2019-12-18 15:08:52,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:52,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236400940] [2019-12-18 15:08:52,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:52,287 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-18 15:08:52,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236400940] [2019-12-18 15:08:52,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:52,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:08:52,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894716565] [2019-12-18 15:08:52,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:08:52,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:52,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:08:52,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:08:52,289 INFO L87 Difference]: Start difference. First operand 21878 states and 73071 transitions. Second operand 5 states. [2019-12-18 15:08:52,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:52,491 INFO L93 Difference]: Finished difference Result 27555 states and 90762 transitions. [2019-12-18 15:08:52,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:08:52,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-18 15:08:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:52,508 INFO L225 Difference]: With dead ends: 27555 [2019-12-18 15:08:52,509 INFO L226 Difference]: Without dead ends: 6337 [2019-12-18 15:08:52,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:08:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2019-12-18 15:08:52,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 6337. [2019-12-18 15:08:52,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6337 states. [2019-12-18 15:08:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6337 states to 6337 states and 19250 transitions. [2019-12-18 15:08:52,716 INFO L78 Accepts]: Start accepts. Automaton has 6337 states and 19250 transitions. Word has length 72 [2019-12-18 15:08:52,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:52,716 INFO L462 AbstractCegarLoop]: Abstraction has 6337 states and 19250 transitions. [2019-12-18 15:08:52,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:08:52,717 INFO L276 IsEmpty]: Start isEmpty. Operand 6337 states and 19250 transitions. [2019-12-18 15:08:52,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:08:52,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:52,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:52,728 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:52,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:52,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1176538835, now seen corresponding path program 2 times [2019-12-18 15:08:52,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:52,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661559660] [2019-12-18 15:08:52,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:53,617 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-18 15:08:53,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661559660] [2019-12-18 15:08:53,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:53,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 15:08:53,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203860793] [2019-12-18 15:08:53,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 15:08:53,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:53,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 15:08:53,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:08:53,620 INFO L87 Difference]: Start difference. First operand 6337 states and 19250 transitions. Second operand 23 states. [2019-12-18 15:08:57,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:57,833 INFO L93 Difference]: Finished difference Result 16255 states and 49265 transitions. [2019-12-18 15:08:57,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-18 15:08:57,833 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-18 15:08:57,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:57,851 INFO L225 Difference]: With dead ends: 16255 [2019-12-18 15:08:57,851 INFO L226 Difference]: Without dead ends: 12177 [2019-12-18 15:08:57,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=404, Invalid=3502, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 15:08:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2019-12-18 15:08:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 9384. [2019-12-18 15:08:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9384 states. [2019-12-18 15:08:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9384 states to 9384 states and 28268 transitions. [2019-12-18 15:08:58,008 INFO L78 Accepts]: Start accepts. Automaton has 9384 states and 28268 transitions. Word has length 72 [2019-12-18 15:08:58,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:58,008 INFO L462 AbstractCegarLoop]: Abstraction has 9384 states and 28268 transitions. [2019-12-18 15:08:58,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 15:08:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 9384 states and 28268 transitions. [2019-12-18 15:08:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:08:58,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:58,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:58,019 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:58,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:58,020 INFO L82 PathProgramCache]: Analyzing trace with hash -631520119, now seen corresponding path program 3 times [2019-12-18 15:08:58,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:58,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835433601] [2019-12-18 15:08:58,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:58,731 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-18 15:08:58,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835433601] [2019-12-18 15:08:58,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:58,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 15:08:58,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999332388] [2019-12-18 15:08:58,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 15:08:58,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:58,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 15:08:58,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2019-12-18 15:08:58,733 INFO L87 Difference]: Start difference. First operand 9384 states and 28268 transitions. Second operand 21 states. [2019-12-18 15:09:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:01,935 INFO L93 Difference]: Finished difference Result 18611 states and 55534 transitions. [2019-12-18 15:09:01,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 15:09:01,935 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2019-12-18 15:09:01,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:01,959 INFO L225 Difference]: With dead ends: 18611 [2019-12-18 15:09:01,959 INFO L226 Difference]: Without dead ends: 15443 [2019-12-18 15:09:01,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=301, Invalid=1955, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 15:09:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15443 states. [2019-12-18 15:09:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15443 to 11372. [2019-12-18 15:09:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11372 states. [2019-12-18 15:09:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11372 states to 11372 states and 34037 transitions. [2019-12-18 15:09:02,153 INFO L78 Accepts]: Start accepts. Automaton has 11372 states and 34037 transitions. Word has length 72 [2019-12-18 15:09:02,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:02,153 INFO L462 AbstractCegarLoop]: Abstraction has 11372 states and 34037 transitions. [2019-12-18 15:09:02,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 15:09:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 11372 states and 34037 transitions. [2019-12-18 15:09:02,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:09:02,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:02,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:02,167 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:02,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:02,167 INFO L82 PathProgramCache]: Analyzing trace with hash -162566405, now seen corresponding path program 4 times [2019-12-18 15:09:02,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:02,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775110549] [2019-12-18 15:09:02,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:02,942 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-18 15:09:02,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775110549] [2019-12-18 15:09:02,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:02,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-18 15:09:02,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103692645] [2019-12-18 15:09:02,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:09:02,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:02,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:09:02,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:09:02,943 INFO L87 Difference]: Start difference. First operand 11372 states and 34037 transitions. Second operand 24 states. [2019-12-18 15:09:05,894 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-12-18 15:09:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:07,539 INFO L93 Difference]: Finished difference Result 16857 states and 50135 transitions. [2019-12-18 15:09:07,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-18 15:09:07,539 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-18 15:09:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:07,562 INFO L225 Difference]: With dead ends: 16857 [2019-12-18 15:09:07,563 INFO L226 Difference]: Without dead ends: 16231 [2019-12-18 15:09:07,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=418, Invalid=3742, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 15:09:07,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16231 states. [2019-12-18 15:09:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16231 to 11067. [2019-12-18 15:09:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11067 states. [2019-12-18 15:09:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11067 states to 11067 states and 33191 transitions. [2019-12-18 15:09:07,776 INFO L78 Accepts]: Start accepts. Automaton has 11067 states and 33191 transitions. Word has length 72 [2019-12-18 15:09:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:07,777 INFO L462 AbstractCegarLoop]: Abstraction has 11067 states and 33191 transitions. [2019-12-18 15:09:07,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:09:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 11067 states and 33191 transitions. [2019-12-18 15:09:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:09:07,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:07,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:07,789 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:07,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:07,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1502322349, now seen corresponding path program 5 times [2019-12-18 15:09:07,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:07,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448565187] [2019-12-18 15:09:07,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:08,175 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-18 15:09:08,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448565187] [2019-12-18 15:09:08,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:08,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:09:08,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332852103] [2019-12-18 15:09:08,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:09:08,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:08,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:09:08,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:09:08,177 INFO L87 Difference]: Start difference. First operand 11067 states and 33191 transitions. Second operand 17 states. [2019-12-18 15:09:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:10,288 INFO L93 Difference]: Finished difference Result 21549 states and 64703 transitions. [2019-12-18 15:09:10,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 15:09:10,289 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-12-18 15:09:10,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:10,315 INFO L225 Difference]: With dead ends: 21549 [2019-12-18 15:09:10,316 INFO L226 Difference]: Without dead ends: 18224 [2019-12-18 15:09:10,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:09:10,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18224 states. [2019-12-18 15:09:10,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18224 to 12914. [2019-12-18 15:09:10,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12914 states. [2019-12-18 15:09:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12914 states to 12914 states and 38442 transitions. [2019-12-18 15:09:10,543 INFO L78 Accepts]: Start accepts. Automaton has 12914 states and 38442 transitions. Word has length 72 [2019-12-18 15:09:10,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:10,544 INFO L462 AbstractCegarLoop]: Abstraction has 12914 states and 38442 transitions. [2019-12-18 15:09:10,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:09:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 12914 states and 38442 transitions. [2019-12-18 15:09:10,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:09:10,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:10,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:10,559 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:10,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:10,559 INFO L82 PathProgramCache]: Analyzing trace with hash 373153609, now seen corresponding path program 6 times [2019-12-18 15:09:10,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:10,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232168545] [2019-12-18 15:09:10,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:11,205 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-18 15:09:11,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232168545] [2019-12-18 15:09:11,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:11,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 15:09:11,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991917693] [2019-12-18 15:09:11,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:09:11,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:11,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:09:11,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:09:11,207 INFO L87 Difference]: Start difference. First operand 12914 states and 38442 transitions. Second operand 20 states. [2019-12-18 15:09:13,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:13,154 INFO L93 Difference]: Finished difference Result 17324 states and 50227 transitions. [2019-12-18 15:09:13,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 15:09:13,155 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-12-18 15:09:13,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:13,179 INFO L225 Difference]: With dead ends: 17324 [2019-12-18 15:09:13,179 INFO L226 Difference]: Without dead ends: 17224 [2019-12-18 15:09:13,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 15:09:13,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17224 states. [2019-12-18 15:09:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17224 to 16051. [2019-12-18 15:09:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16051 states. [2019-12-18 15:09:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16051 states to 16051 states and 46869 transitions. [2019-12-18 15:09:13,536 INFO L78 Accepts]: Start accepts. Automaton has 16051 states and 46869 transitions. Word has length 72 [2019-12-18 15:09:13,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:13,537 INFO L462 AbstractCegarLoop]: Abstraction has 16051 states and 46869 transitions. [2019-12-18 15:09:13,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:09:13,537 INFO L276 IsEmpty]: Start isEmpty. Operand 16051 states and 46869 transitions. [2019-12-18 15:09:13,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:09:13,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:13,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:13,555 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:13,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:13,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1246067147, now seen corresponding path program 7 times [2019-12-18 15:09:13,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:13,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132057321] [2019-12-18 15:09:13,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:14,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-18 15:09:14,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132057321] [2019-12-18 15:09:14,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:14,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 15:09:14,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533003462] [2019-12-18 15:09:14,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 15:09:14,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:14,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 15:09:14,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:09:14,545 INFO L87 Difference]: Start difference. First operand 16051 states and 46869 transitions. Second operand 23 states. [2019-12-18 15:09:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:16,915 INFO L93 Difference]: Finished difference Result 17602 states and 50880 transitions. [2019-12-18 15:09:16,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 15:09:16,916 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-18 15:09:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:16,939 INFO L225 Difference]: With dead ends: 17602 [2019-12-18 15:09:16,940 INFO L226 Difference]: Without dead ends: 16810 [2019-12-18 15:09:16,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=196, Invalid=1526, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 15:09:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16810 states. [2019-12-18 15:09:17,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16810 to 15302. [2019-12-18 15:09:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15302 states. [2019-12-18 15:09:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15302 states to 15302 states and 44747 transitions. [2019-12-18 15:09:17,163 INFO L78 Accepts]: Start accepts. Automaton has 15302 states and 44747 transitions. Word has length 72 [2019-12-18 15:09:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:17,164 INFO L462 AbstractCegarLoop]: Abstraction has 15302 states and 44747 transitions. [2019-12-18 15:09:17,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 15:09:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 15302 states and 44747 transitions. [2019-12-18 15:09:17,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:09:17,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:17,179 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:17,179 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:17,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:17,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2034784249, now seen corresponding path program 8 times [2019-12-18 15:09:17,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:17,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286611045] [2019-12-18 15:09:17,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:17,603 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-18 15:09:17,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286611045] [2019-12-18 15:09:17,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:17,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 15:09:17,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029315103] [2019-12-18 15:09:17,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:09:17,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:17,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:09:17,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:09:17,605 INFO L87 Difference]: Start difference. First operand 15302 states and 44747 transitions. Second operand 18 states. [2019-12-18 15:09:20,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:20,870 INFO L93 Difference]: Finished difference Result 32099 states and 95632 transitions. [2019-12-18 15:09:20,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 15:09:20,870 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-12-18 15:09:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:20,911 INFO L225 Difference]: With dead ends: 32099 [2019-12-18 15:09:20,912 INFO L226 Difference]: Without dead ends: 23094 [2019-12-18 15:09:20,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=526, Invalid=3380, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 15:09:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23094 states. [2019-12-18 15:09:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23094 to 16519. [2019-12-18 15:09:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16519 states. [2019-12-18 15:09:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16519 states to 16519 states and 48220 transitions. [2019-12-18 15:09:21,336 INFO L78 Accepts]: Start accepts. Automaton has 16519 states and 48220 transitions. Word has length 72 [2019-12-18 15:09:21,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:21,336 INFO L462 AbstractCegarLoop]: Abstraction has 16519 states and 48220 transitions. [2019-12-18 15:09:21,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:09:21,336 INFO L276 IsEmpty]: Start isEmpty. Operand 16519 states and 48220 transitions. [2019-12-18 15:09:21,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:09:21,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:21,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:21,353 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:21,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:21,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2027178475, now seen corresponding path program 9 times [2019-12-18 15:09:21,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:21,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733687747] [2019-12-18 15:09:21,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:22,206 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-18 15:09:22,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733687747] [2019-12-18 15:09:22,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:22,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-18 15:09:22,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048506849] [2019-12-18 15:09:22,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-18 15:09:22,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:22,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-18 15:09:22,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:09:22,208 INFO L87 Difference]: Start difference. First operand 16519 states and 48220 transitions. Second operand 25 states. [2019-12-18 15:09:27,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:27,322 INFO L93 Difference]: Finished difference Result 29378 states and 86962 transitions. [2019-12-18 15:09:27,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-18 15:09:27,322 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2019-12-18 15:09:27,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:27,357 INFO L225 Difference]: With dead ends: 29378 [2019-12-18 15:09:27,357 INFO L226 Difference]: Without dead ends: 25345 [2019-12-18 15:09:27,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=473, Invalid=4497, Unknown=0, NotChecked=0, Total=4970 [2019-12-18 15:09:27,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25345 states. [2019-12-18 15:09:27,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25345 to 15970. [2019-12-18 15:09:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15970 states. [2019-12-18 15:09:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15970 states to 15970 states and 46964 transitions. [2019-12-18 15:09:27,648 INFO L78 Accepts]: Start accepts. Automaton has 15970 states and 46964 transitions. Word has length 72 [2019-12-18 15:09:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:27,649 INFO L462 AbstractCegarLoop]: Abstraction has 15970 states and 46964 transitions. [2019-12-18 15:09:27,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-18 15:09:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 15970 states and 46964 transitions. [2019-12-18 15:09:27,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:09:27,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:27,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:27,665 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:27,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:27,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1784303799, now seen corresponding path program 10 times [2019-12-18 15:09:27,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:27,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954142230] [2019-12-18 15:09:27,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:28,245 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-18 15:09:28,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954142230] [2019-12-18 15:09:28,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:28,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 15:09:28,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739925102] [2019-12-18 15:09:28,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 15:09:28,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:28,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 15:09:28,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:09:28,248 INFO L87 Difference]: Start difference. First operand 15970 states and 46964 transitions. Second operand 23 states. [2019-12-18 15:09:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:31,275 INFO L93 Difference]: Finished difference Result 36169 states and 108740 transitions. [2019-12-18 15:09:31,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 15:09:31,276 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-18 15:09:31,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:31,316 INFO L225 Difference]: With dead ends: 36169 [2019-12-18 15:09:31,316 INFO L226 Difference]: Without dead ends: 28676 [2019-12-18 15:09:31,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=318, Invalid=2232, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 15:09:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28676 states. [2019-12-18 15:09:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28676 to 15866. [2019-12-18 15:09:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15866 states. [2019-12-18 15:09:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15866 states to 15866 states and 47073 transitions. [2019-12-18 15:09:31,634 INFO L78 Accepts]: Start accepts. Automaton has 15866 states and 47073 transitions. Word has length 72 [2019-12-18 15:09:31,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:31,635 INFO L462 AbstractCegarLoop]: Abstraction has 15866 states and 47073 transitions. [2019-12-18 15:09:31,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 15:09:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 15866 states and 47073 transitions. [2019-12-18 15:09:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:09:31,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:31,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:31,651 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:31,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:31,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1144645421, now seen corresponding path program 11 times [2019-12-18 15:09:31,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:31,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723863046] [2019-12-18 15:09:31,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:32,298 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-18 15:09:32,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723863046] [2019-12-18 15:09:32,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:32,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 15:09:32,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236205224] [2019-12-18 15:09:32,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 15:09:32,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:32,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 15:09:32,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:09:32,300 INFO L87 Difference]: Start difference. First operand 15866 states and 47073 transitions. Second operand 23 states. [2019-12-18 15:09:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:36,356 INFO L93 Difference]: Finished difference Result 29803 states and 88736 transitions. [2019-12-18 15:09:36,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-18 15:09:36,356 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-18 15:09:36,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:36,397 INFO L225 Difference]: With dead ends: 29803 [2019-12-18 15:09:36,397 INFO L226 Difference]: Without dead ends: 29559 [2019-12-18 15:09:36,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1021 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=436, Invalid=3596, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 15:09:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29559 states. [2019-12-18 15:09:36,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29559 to 15842. [2019-12-18 15:09:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15842 states. [2019-12-18 15:09:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15842 states to 15842 states and 47028 transitions. [2019-12-18 15:09:36,715 INFO L78 Accepts]: Start accepts. Automaton has 15842 states and 47028 transitions. Word has length 72 [2019-12-18 15:09:36,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:36,715 INFO L462 AbstractCegarLoop]: Abstraction has 15842 states and 47028 transitions. [2019-12-18 15:09:36,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 15:09:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 15842 states and 47028 transitions. [2019-12-18 15:09:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:09:36,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:36,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:36,732 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:36,732 INFO L82 PathProgramCache]: Analyzing trace with hash -267641825, now seen corresponding path program 12 times [2019-12-18 15:09:36,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:36,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889315989] [2019-12-18 15:09:36,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:37,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889315989] [2019-12-18 15:09:37,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:37,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:09:37,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830870260] [2019-12-18 15:09:37,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:09:37,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:37,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:09:37,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:09:37,187 INFO L87 Difference]: Start difference. First operand 15842 states and 47028 transitions. Second operand 14 states. [2019-12-18 15:09:39,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:39,661 INFO L93 Difference]: Finished difference Result 34675 states and 102650 transitions. [2019-12-18 15:09:39,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 15:09:39,662 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2019-12-18 15:09:39,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:39,699 INFO L225 Difference]: With dead ends: 34675 [2019-12-18 15:09:39,700 INFO L226 Difference]: Without dead ends: 27653 [2019-12-18 15:09:39,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=367, Invalid=1703, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 15:09:39,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27653 states. [2019-12-18 15:09:39,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27653 to 18119. [2019-12-18 15:09:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18119 states. [2019-12-18 15:09:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18119 states to 18119 states and 53399 transitions. [2019-12-18 15:09:39,995 INFO L78 Accepts]: Start accepts. Automaton has 18119 states and 53399 transitions. Word has length 72 [2019-12-18 15:09:39,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:39,995 INFO L462 AbstractCegarLoop]: Abstraction has 18119 states and 53399 transitions. [2019-12-18 15:09:39,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:09:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 18119 states and 53399 transitions. [2019-12-18 15:09:40,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:09:40,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:40,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:40,013 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:40,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:40,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2073995537, now seen corresponding path program 13 times [2019-12-18 15:09:40,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:40,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587805083] [2019-12-18 15:09:40,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:40,764 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-18 15:09:40,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587805083] [2019-12-18 15:09:40,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:40,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-18 15:09:40,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880173455] [2019-12-18 15:09:40,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:09:40,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:40,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:09:40,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:09:40,769 INFO L87 Difference]: Start difference. First operand 18119 states and 53399 transitions. Second operand 24 states. [2019-12-18 15:09:44,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:44,785 INFO L93 Difference]: Finished difference Result 26680 states and 79484 transitions. [2019-12-18 15:09:44,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 15:09:44,786 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-18 15:09:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:44,820 INFO L225 Difference]: With dead ends: 26680 [2019-12-18 15:09:44,820 INFO L226 Difference]: Without dead ends: 24536 [2019-12-18 15:09:44,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=286, Invalid=2366, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 15:09:44,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24536 states. [2019-12-18 15:09:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24536 to 19073. [2019-12-18 15:09:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19073 states. [2019-12-18 15:09:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19073 states to 19073 states and 56266 transitions. [2019-12-18 15:09:45,283 INFO L78 Accepts]: Start accepts. Automaton has 19073 states and 56266 transitions. Word has length 72 [2019-12-18 15:09:45,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:45,283 INFO L462 AbstractCegarLoop]: Abstraction has 19073 states and 56266 transitions. [2019-12-18 15:09:45,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:09:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 19073 states and 56266 transitions. [2019-12-18 15:09:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:09:45,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:45,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, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:45,303 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:45,304 INFO L82 PathProgramCache]: Analyzing trace with hash -55574523, now seen corresponding path program 14 times [2019-12-18 15:09:45,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:45,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521198329] [2019-12-18 15:09:45,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:45,920 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-18 15:09:45,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521198329] [2019-12-18 15:09:45,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:45,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-18 15:09:45,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452416602] [2019-12-18 15:09:45,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:09:45,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:45,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:09:45,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:09:45,922 INFO L87 Difference]: Start difference. First operand 19073 states and 56266 transitions. Second operand 24 states. [2019-12-18 15:09:49,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:49,595 INFO L93 Difference]: Finished difference Result 28521 states and 84443 transitions. [2019-12-18 15:09:49,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 15:09:49,596 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-18 15:09:49,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:49,634 INFO L225 Difference]: With dead ends: 28521 [2019-12-18 15:09:49,634 INFO L226 Difference]: Without dead ends: 26494 [2019-12-18 15:09:49,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=338, Invalid=2524, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 15:09:49,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26494 states. [2019-12-18 15:09:49,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26494 to 21685. [2019-12-18 15:09:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21685 states. [2019-12-18 15:09:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21685 states to 21685 states and 64215 transitions. [2019-12-18 15:09:50,005 INFO L78 Accepts]: Start accepts. Automaton has 21685 states and 64215 transitions. Word has length 72 [2019-12-18 15:09:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:50,005 INFO L462 AbstractCegarLoop]: Abstraction has 21685 states and 64215 transitions. [2019-12-18 15:09:50,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:09:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 21685 states and 64215 transitions. [2019-12-18 15:09:50,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:09:50,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:50,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:50,029 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:50,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:50,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1680209337, now seen corresponding path program 15 times [2019-12-18 15:09:50,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:50,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896588922] [2019-12-18 15:09:50,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:50,808 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-18 15:09:50,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896588922] [2019-12-18 15:09:50,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:50,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 15:09:50,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394428857] [2019-12-18 15:09:50,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:09:50,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:50,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:09:50,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:09:50,811 INFO L87 Difference]: Start difference. First operand 21685 states and 64215 transitions. Second operand 19 states. [2019-12-18 15:09:59,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:59,012 INFO L93 Difference]: Finished difference Result 37153 states and 109028 transitions. [2019-12-18 15:09:59,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-18 15:09:59,013 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2019-12-18 15:09:59,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:59,056 INFO L225 Difference]: With dead ends: 37153 [2019-12-18 15:09:59,056 INFO L226 Difference]: Without dead ends: 32769 [2019-12-18 15:09:59,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=637, Invalid=3523, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 15:09:59,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32769 states. [2019-12-18 15:09:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32769 to 22198. [2019-12-18 15:09:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22198 states. [2019-12-18 15:09:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22198 states to 22198 states and 65563 transitions. [2019-12-18 15:09:59,409 INFO L78 Accepts]: Start accepts. Automaton has 22198 states and 65563 transitions. Word has length 72 [2019-12-18 15:09:59,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:59,409 INFO L462 AbstractCegarLoop]: Abstraction has 22198 states and 65563 transitions. [2019-12-18 15:09:59,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:09:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 22198 states and 65563 transitions. [2019-12-18 15:09:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:09:59,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:59,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:59,431 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:59,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:59,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1878751243, now seen corresponding path program 16 times [2019-12-18 15:09:59,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:59,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776539585] [2019-12-18 15:09:59,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:00,092 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-18 15:10:00,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776539585] [2019-12-18 15:10:00,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:00,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 15:10:00,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800966263] [2019-12-18 15:10:00,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:10:00,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:00,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:10:00,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:10:00,095 INFO L87 Difference]: Start difference. First operand 22198 states and 65563 transitions. Second operand 20 states. [2019-12-18 15:10:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:01,445 INFO L93 Difference]: Finished difference Result 31786 states and 94048 transitions. [2019-12-18 15:10:01,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 15:10:01,446 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-12-18 15:10:01,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:01,487 INFO L225 Difference]: With dead ends: 31786 [2019-12-18 15:10:01,487 INFO L226 Difference]: Without dead ends: 28926 [2019-12-18 15:10:01,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 15:10:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28926 states. [2019-12-18 15:10:01,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28926 to 23046. [2019-12-18 15:10:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23046 states. [2019-12-18 15:10:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23046 states to 23046 states and 68006 transitions. [2019-12-18 15:10:01,879 INFO L78 Accepts]: Start accepts. Automaton has 23046 states and 68006 transitions. Word has length 72 [2019-12-18 15:10:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:01,879 INFO L462 AbstractCegarLoop]: Abstraction has 23046 states and 68006 transitions. [2019-12-18 15:10:01,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:10:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 23046 states and 68006 transitions. [2019-12-18 15:10:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:10:01,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:01,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:10:01,909 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:01,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:01,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1364589351, now seen corresponding path program 17 times [2019-12-18 15:10:01,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:01,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209250250] [2019-12-18 15:10:01,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:02,452 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2019-12-18 15:10:03,448 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-18 15:10:03,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209250250] [2019-12-18 15:10:03,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:03,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-12-18 15:10:03,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9767767] [2019-12-18 15:10:03,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-18 15:10:03,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:03,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-18 15:10:03,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2019-12-18 15:10:03,450 INFO L87 Difference]: Start difference. First operand 23046 states and 68006 transitions. Second operand 28 states. [2019-12-18 15:10:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:10,138 INFO L93 Difference]: Finished difference Result 38559 states and 114608 transitions. [2019-12-18 15:10:10,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-18 15:10:10,145 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 72 [2019-12-18 15:10:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:10,204 INFO L225 Difference]: With dead ends: 38559 [2019-12-18 15:10:10,204 INFO L226 Difference]: Without dead ends: 34713 [2019-12-18 15:10:10,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1614 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=684, Invalid=5168, Unknown=0, NotChecked=0, Total=5852 [2019-12-18 15:10:10,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34713 states. [2019-12-18 15:10:10,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34713 to 25346. [2019-12-18 15:10:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25346 states. [2019-12-18 15:10:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25346 states to 25346 states and 74425 transitions. [2019-12-18 15:10:10,645 INFO L78 Accepts]: Start accepts. Automaton has 25346 states and 74425 transitions. Word has length 72 [2019-12-18 15:10:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:10,645 INFO L462 AbstractCegarLoop]: Abstraction has 25346 states and 74425 transitions. [2019-12-18 15:10:10,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-18 15:10:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 25346 states and 74425 transitions. [2019-12-18 15:10:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:10:10,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:10,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:10:10,676 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:10,676 INFO L82 PathProgramCache]: Analyzing trace with hash -636832775, now seen corresponding path program 18 times [2019-12-18 15:10:10,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:10,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102476957] [2019-12-18 15:10:10,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:11,141 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-18 15:10:11,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102476957] [2019-12-18 15:10:11,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:11,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:10:11,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191934051] [2019-12-18 15:10:11,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:10:11,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:11,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:10:11,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:10:11,144 INFO L87 Difference]: Start difference. First operand 25346 states and 74425 transitions. Second operand 14 states. [2019-12-18 15:10:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:15,074 INFO L93 Difference]: Finished difference Result 44082 states and 128283 transitions. [2019-12-18 15:10:15,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 15:10:15,075 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2019-12-18 15:10:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:15,135 INFO L225 Difference]: With dead ends: 44082 [2019-12-18 15:10:15,135 INFO L226 Difference]: Without dead ends: 38653 [2019-12-18 15:10:15,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=331, Invalid=2021, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 15:10:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38653 states. [2019-12-18 15:10:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38653 to 26135. [2019-12-18 15:10:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26135 states. [2019-12-18 15:10:15,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26135 states to 26135 states and 76737 transitions. [2019-12-18 15:10:15,602 INFO L78 Accepts]: Start accepts. Automaton has 26135 states and 76737 transitions. Word has length 72 [2019-12-18 15:10:15,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:15,603 INFO L462 AbstractCegarLoop]: Abstraction has 26135 states and 76737 transitions. [2019-12-18 15:10:15,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:10:15,603 INFO L276 IsEmpty]: Start isEmpty. Operand 26135 states and 76737 transitions. [2019-12-18 15:10:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:10:15,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:15,632 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:10:15,632 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:15,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:15,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1219056769, now seen corresponding path program 19 times [2019-12-18 15:10:15,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:15,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826358120] [2019-12-18 15:10:15,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:15,866 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-18 15:10:15,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826358120] [2019-12-18 15:10:15,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:15,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:10:15,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885831409] [2019-12-18 15:10:15,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:10:15,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:15,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:10:15,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:10:15,869 INFO L87 Difference]: Start difference. First operand 26135 states and 76737 transitions. Second operand 11 states. [2019-12-18 15:10:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:17,186 INFO L93 Difference]: Finished difference Result 38217 states and 111788 transitions. [2019-12-18 15:10:17,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 15:10:17,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-12-18 15:10:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:17,244 INFO L225 Difference]: With dead ends: 38217 [2019-12-18 15:10:17,244 INFO L226 Difference]: Without dead ends: 34072 [2019-12-18 15:10:17,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2019-12-18 15:10:17,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34072 states. [2019-12-18 15:10:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34072 to 26583. [2019-12-18 15:10:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26583 states. [2019-12-18 15:10:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26583 states to 26583 states and 77709 transitions. [2019-12-18 15:10:17,687 INFO L78 Accepts]: Start accepts. Automaton has 26583 states and 77709 transitions. Word has length 72 [2019-12-18 15:10:17,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:17,687 INFO L462 AbstractCegarLoop]: Abstraction has 26583 states and 77709 transitions. [2019-12-18 15:10:17,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:10:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 26583 states and 77709 transitions. [2019-12-18 15:10:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:10:17,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:17,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:10:17,722 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:17,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:17,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1900521947, now seen corresponding path program 20 times [2019-12-18 15:10:17,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:17,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284541232] [2019-12-18 15:10:17,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:17,932 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-18 15:10:17,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284541232] [2019-12-18 15:10:17,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:17,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:10:17,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147929109] [2019-12-18 15:10:17,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:10:17,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:17,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:10:17,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:10:17,933 INFO L87 Difference]: Start difference. First operand 26583 states and 77709 transitions. Second operand 12 states. [2019-12-18 15:10:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:19,263 INFO L93 Difference]: Finished difference Result 32042 states and 91951 transitions. [2019-12-18 15:10:19,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 15:10:19,264 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2019-12-18 15:10:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:19,306 INFO L225 Difference]: With dead ends: 32042 [2019-12-18 15:10:19,307 INFO L226 Difference]: Without dead ends: 31484 [2019-12-18 15:10:19,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:10:19,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31484 states. [2019-12-18 15:10:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31484 to 26586. [2019-12-18 15:10:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26586 states. [2019-12-18 15:10:19,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26586 states to 26586 states and 77680 transitions. [2019-12-18 15:10:19,892 INFO L78 Accepts]: Start accepts. Automaton has 26586 states and 77680 transitions. Word has length 72 [2019-12-18 15:10:19,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:19,892 INFO L462 AbstractCegarLoop]: Abstraction has 26586 states and 77680 transitions. [2019-12-18 15:10:19,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:10:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 26586 states and 77680 transitions. [2019-12-18 15:10:19,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:10:19,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:19,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:10:19,920 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:19,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:19,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1219459465, now seen corresponding path program 21 times [2019-12-18 15:10:19,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:19,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164236564] [2019-12-18 15:10:19,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:20,686 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-18 15:10:20,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164236564] [2019-12-18 15:10:20,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:20,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 15:10:20,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406180733] [2019-12-18 15:10:20,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 15:10:20,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:20,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 15:10:20,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:10:20,688 INFO L87 Difference]: Start difference. First operand 26586 states and 77680 transitions. Second operand 23 states. [2019-12-18 15:10:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:26,033 INFO L93 Difference]: Finished difference Result 56628 states and 168760 transitions. [2019-12-18 15:10:26,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 15:10:26,034 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-18 15:10:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:26,120 INFO L225 Difference]: With dead ends: 56628 [2019-12-18 15:10:26,120 INFO L226 Difference]: Without dead ends: 56440 [2019-12-18 15:10:26,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=319, Invalid=2333, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 15:10:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56440 states. [2019-12-18 15:10:26,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56440 to 38055. [2019-12-18 15:10:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38055 states. [2019-12-18 15:10:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38055 states to 38055 states and 113728 transitions. [2019-12-18 15:10:26,826 INFO L78 Accepts]: Start accepts. Automaton has 38055 states and 113728 transitions. Word has length 72 [2019-12-18 15:10:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:26,827 INFO L462 AbstractCegarLoop]: Abstraction has 38055 states and 113728 transitions. [2019-12-18 15:10:26,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 15:10:26,827 INFO L276 IsEmpty]: Start isEmpty. Operand 38055 states and 113728 transitions. [2019-12-18 15:10:26,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:10:26,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:26,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:10:26,873 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:26,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:26,873 INFO L82 PathProgramCache]: Analyzing trace with hash -954954121, now seen corresponding path program 22 times [2019-12-18 15:10:26,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:26,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451924730] [2019-12-18 15:10:26,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:27,400 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-12-18 15:10:28,345 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-18 15:10:28,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451924730] [2019-12-18 15:10:28,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:28,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-18 15:10:28,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075101367] [2019-12-18 15:10:28,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:10:28,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:28,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:10:28,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:10:28,348 INFO L87 Difference]: Start difference. First operand 38055 states and 113728 transitions. Second operand 24 states. [2019-12-18 15:10:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:34,094 INFO L93 Difference]: Finished difference Result 56486 states and 168313 transitions. [2019-12-18 15:10:34,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 15:10:34,094 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-18 15:10:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:34,176 INFO L225 Difference]: With dead ends: 56486 [2019-12-18 15:10:34,177 INFO L226 Difference]: Without dead ends: 56306 [2019-12-18 15:10:34,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=329, Invalid=2427, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 15:10:34,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56306 states. [2019-12-18 15:10:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56306 to 36979. [2019-12-18 15:10:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36979 states. [2019-12-18 15:10:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36979 states to 36979 states and 110703 transitions. [2019-12-18 15:10:34,854 INFO L78 Accepts]: Start accepts. Automaton has 36979 states and 110703 transitions. Word has length 72 [2019-12-18 15:10:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:34,854 INFO L462 AbstractCegarLoop]: Abstraction has 36979 states and 110703 transitions. [2019-12-18 15:10:34,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:10:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 36979 states and 110703 transitions. [2019-12-18 15:10:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 15:10:34,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:34,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:10:34,896 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:34,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:34,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1312956969, now seen corresponding path program 23 times [2019-12-18 15:10:34,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:34,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915300063] [2019-12-18 15:10:34,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:35,659 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-18 15:10:35,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915300063] [2019-12-18 15:10:35,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:35,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 15:10:35,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061567073] [2019-12-18 15:10:35,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 15:10:35,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:35,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 15:10:35,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:10:35,660 INFO L87 Difference]: Start difference. First operand 36979 states and 110703 transitions. Second operand 23 states. Received shutdown request... [2019-12-18 15:10:41,559 WARN L209 SmtUtils]: Removed 7 from assertion stack [2019-12-18 15:10:41,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 15:10:41,559 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 15:10:41,562 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 15:10:41,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:10:41 BasicIcfg [2019-12-18 15:10:41,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:10:41,564 INFO L168 Benchmark]: Toolchain (without parser) took 235303.99 ms. Allocated memory was 146.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 102.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 15:10:41,564 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 15:10:41,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 904.10 ms. Allocated memory was 146.3 MB in the beginning and 209.2 MB in the end (delta: 62.9 MB). Free memory was 102.0 MB in the beginning and 159.5 MB in the end (delta: -57.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 15:10:41,565 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.52 ms. Allocated memory is still 209.2 MB. Free memory was 159.5 MB in the beginning and 156.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:10:41,565 INFO L168 Benchmark]: Boogie Preprocessor took 73.39 ms. Allocated memory is still 209.2 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:10:41,566 INFO L168 Benchmark]: RCFGBuilder took 1048.93 ms. Allocated memory was 209.2 MB in the beginning and 233.3 MB in the end (delta: 24.1 MB). Free memory was 154.1 MB in the beginning and 195.9 MB in the end (delta: -41.9 MB). Peak memory consumption was 64.2 MB. Max. memory is 7.1 GB. [2019-12-18 15:10:41,566 INFO L168 Benchmark]: TraceAbstraction took 233207.76 ms. Allocated memory was 233.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 195.9 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 15:10:41,569 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.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 904.10 ms. Allocated memory was 146.3 MB in the beginning and 209.2 MB in the end (delta: 62.9 MB). Free memory was 102.0 MB in the beginning and 159.5 MB in the end (delta: -57.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.52 ms. Allocated memory is still 209.2 MB. Free memory was 159.5 MB in the beginning and 156.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.39 ms. Allocated memory is still 209.2 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1048.93 ms. Allocated memory was 209.2 MB in the beginning and 233.3 MB in the end (delta: 24.1 MB). Free memory was 154.1 MB in the beginning and 195.9 MB in the end (delta: -41.9 MB). Peak memory consumption was 64.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 233207.76 ms. Allocated memory was 233.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 195.9 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.5s, 223 ProgramPointsBefore, 117 ProgramPointsAfterwards, 276 TransitionsBefore, 138 TransitionsAfterwards, 32976 CoEnabledTransitionPairs, 8 FixpointIterations, 50 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 62 ConcurrentYvCompositions, 36 ChoiceCompositions, 12209 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 32 SemBasedMoverChecksPositive, 347 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 183707 CheckedPairsTotal, 146 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (36979states) and FLOYD_HOARE automaton (currently 52 states, 23 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 31 for 15ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 214 locations, 1 error locations. Result: TIMEOUT, OverallTime: 232.9s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 93.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8294 SDtfs, 18815 SDslu, 84162 SDs, 0 SdLazy, 55518 SolverSat, 1949 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 45.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1220 GetRequests, 59 SyntacticMatches, 51 SemanticMatches, 1109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14721 ImplicationChecksByTransitivity, 38.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=300418occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 174604 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 1987 NumberOfCodeBlocks, 1987 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1956 ConstructedInterpolants, 0 QuantifiedInterpolants, 2028190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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