/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:02:03,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:02:03,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:02:03,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:02:03,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:02:03,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:02:03,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:02:03,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:02:03,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:02:03,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:02:03,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:02:03,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:02:03,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:02:03,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:02:03,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:02:03,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:02:03,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:02:03,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:02:03,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:02:03,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:02:03,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:02:03,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:02:03,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:02:03,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:02:03,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:02:03,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:02:03,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:02:03,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:02:03,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:02:03,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:02:03,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:02:03,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:02:03,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:02:03,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:02:03,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:02:03,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:02:03,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:02:03,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:02:03,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:02:03,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:02:03,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:02:03,262 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:02:03,284 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:02:03,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:02:03,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:02:03,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:02:03,289 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:02:03,289 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:02:03,290 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:02:03,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:02:03,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:02:03,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:02:03,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:02:03,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:02:03,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:02:03,292 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:02:03,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:02:03,293 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:02:03,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:02:03,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:02:03,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:02:03,294 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:02:03,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:02:03,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:02:03,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:02:03,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:02:03,299 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:02:03,299 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:02:03,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:02:03,300 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:02:03,300 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:02:03,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:02:03,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:02:03,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:02:03,612 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:02:03,613 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:02:03,613 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt.i [2019-12-27 02:02:03,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14478c5f3/49317d1e67f34c7f8f335cfe18cb4f0a/FLAG0595d3c71 [2019-12-27 02:02:04,225 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:02:04,226 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_power.opt.i [2019-12-27 02:02:04,242 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14478c5f3/49317d1e67f34c7f8f335cfe18cb4f0a/FLAG0595d3c71 [2019-12-27 02:02:04,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14478c5f3/49317d1e67f34c7f8f335cfe18cb4f0a [2019-12-27 02:02:04,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:02:04,534 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:02:04,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:02:04,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:02:04,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:02:04,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:02:04" (1/1) ... [2019-12-27 02:02:04,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:02:04, skipping insertion in model container [2019-12-27 02:02:04,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:02:04" (1/1) ... [2019-12-27 02:02:04,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:02:04,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:02:05,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:02:05,149 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:02:05,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:02:05,290 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:02:05,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:02:05 WrapperNode [2019-12-27 02:02:05,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:02:05,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:02:05,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:02:05,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:02:05,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:02:05" (1/1) ... [2019-12-27 02:02:05,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:02:05" (1/1) ... [2019-12-27 02:02:05,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:02:05,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:02:05,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:02:05,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:02:05,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:02:05" (1/1) ... [2019-12-27 02:02:05,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:02:05" (1/1) ... [2019-12-27 02:02:05,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:02:05" (1/1) ... [2019-12-27 02:02:05,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:02:05" (1/1) ... [2019-12-27 02:02:05,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:02:05" (1/1) ... [2019-12-27 02:02:05,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:02:05" (1/1) ... [2019-12-27 02:02:05,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:02:05" (1/1) ... [2019-12-27 02:02:05,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:02:05,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:02:05,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:02:05,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:02:05,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:02:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:02:05,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:02:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:02:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:02:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:02:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:02:05,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:02:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:02:05,480 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:02:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:02:05,480 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:02:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:02:05,481 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:02:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:02:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:02:05,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:02:05,483 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:02:06,217 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:02:06,217 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:02:06,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:02:06 BoogieIcfgContainer [2019-12-27 02:02:06,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:02:06,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:02:06,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:02:06,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:02:06,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:02:04" (1/3) ... [2019-12-27 02:02:06,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585c2c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:02:06, skipping insertion in model container [2019-12-27 02:02:06,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:02:05" (2/3) ... [2019-12-27 02:02:06,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585c2c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:02:06, skipping insertion in model container [2019-12-27 02:02:06,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:02:06" (3/3) ... [2019-12-27 02:02:06,228 INFO L109 eAbstractionObserver]: Analyzing ICFG mix027_power.opt.i [2019-12-27 02:02:06,239 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:02:06,239 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:02:06,250 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:02:06,253 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:02:06,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,324 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,324 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,328 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,329 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,393 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,393 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,393 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,394 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,395 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,405 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,405 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,417 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,420 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,420 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,427 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,427 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,431 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,434 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,437 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,437 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,437 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:02:06,454 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:02:06,475 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:02:06,476 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:02:06,476 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:02:06,476 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:02:06,476 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:02:06,476 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:02:06,476 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:02:06,476 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:02:06,499 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-27 02:02:06,501 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 02:02:06,614 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 02:02:06,615 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:02:06,631 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 02:02:06,655 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 02:02:06,711 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 02:02:06,711 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:02:06,719 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 451 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 02:02:06,741 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 02:02:06,742 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:02:11,917 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 02:02:12,428 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 02:02:12,564 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 02:02:12,594 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74757 [2019-12-27 02:02:12,594 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 02:02:12,598 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-27 02:02:52,519 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 171250 states. [2019-12-27 02:02:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 171250 states. [2019-12-27 02:02:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 02:02:52,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:02:52,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:02:52,528 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:02:52,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:02:52,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1969539409, now seen corresponding path program 1 times [2019-12-27 02:02:52,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:02:52,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908592243] [2019-12-27 02:02:52,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:02:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:02:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:02:52,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908592243] [2019-12-27 02:02:52,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:02:52,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:02:52,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444310725] [2019-12-27 02:02:52,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:02:52,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:02:52,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:02:52,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:02:52,875 INFO L87 Difference]: Start difference. First operand 171250 states. Second operand 3 states. [2019-12-27 02:02:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:02:57,761 INFO L93 Difference]: Finished difference Result 169554 states and 814774 transitions. [2019-12-27 02:02:57,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:02:57,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 02:02:57,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:02:58,793 INFO L225 Difference]: With dead ends: 169554 [2019-12-27 02:02:58,793 INFO L226 Difference]: Without dead ends: 159076 [2019-12-27 02:02:58,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:03:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159076 states. [2019-12-27 02:03:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159076 to 159076. [2019-12-27 02:03:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159076 states. [2019-12-27 02:03:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159076 states to 159076 states and 763437 transitions. [2019-12-27 02:03:18,264 INFO L78 Accepts]: Start accepts. Automaton has 159076 states and 763437 transitions. Word has length 7 [2019-12-27 02:03:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:03:18,265 INFO L462 AbstractCegarLoop]: Abstraction has 159076 states and 763437 transitions. [2019-12-27 02:03:18,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:03:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 159076 states and 763437 transitions. [2019-12-27 02:03:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:03:18,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:03:18,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:03:18,278 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:03:18,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:03:18,279 INFO L82 PathProgramCache]: Analyzing trace with hash 230524214, now seen corresponding path program 1 times [2019-12-27 02:03:18,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:03:18,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080886063] [2019-12-27 02:03:18,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:03:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:03:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:03:18,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080886063] [2019-12-27 02:03:18,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:03:18,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:03:18,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866129480] [2019-12-27 02:03:18,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:03:18,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:03:18,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:03:18,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:03:18,413 INFO L87 Difference]: Start difference. First operand 159076 states and 763437 transitions. Second operand 4 states. [2019-12-27 02:03:25,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:03:25,852 INFO L93 Difference]: Finished difference Result 251868 states and 1162713 transitions. [2019-12-27 02:03:25,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:03:25,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:03:25,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:03:27,634 INFO L225 Difference]: With dead ends: 251868 [2019-12-27 02:03:27,634 INFO L226 Difference]: Without dead ends: 251658 [2019-12-27 02:03:27,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:03:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251658 states. [2019-12-27 02:03:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251658 to 235278. [2019-12-27 02:03:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235278 states. [2019-12-27 02:03:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235278 states to 235278 states and 1094580 transitions. [2019-12-27 02:03:52,186 INFO L78 Accepts]: Start accepts. Automaton has 235278 states and 1094580 transitions. Word has length 15 [2019-12-27 02:03:52,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:03:52,186 INFO L462 AbstractCegarLoop]: Abstraction has 235278 states and 1094580 transitions. [2019-12-27 02:03:52,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:03:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 235278 states and 1094580 transitions. [2019-12-27 02:03:52,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:03:52,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:03:52,193 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:03:52,194 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:03:52,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:03:52,194 INFO L82 PathProgramCache]: Analyzing trace with hash -519494263, now seen corresponding path program 1 times [2019-12-27 02:03:52,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:03:52,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325273831] [2019-12-27 02:03:52,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:03:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:03:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:03:52,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325273831] [2019-12-27 02:03:52,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:03:52,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:03:52,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103508691] [2019-12-27 02:03:52,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:03:52,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:03:52,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:03:52,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:03:52,248 INFO L87 Difference]: Start difference. First operand 235278 states and 1094580 transitions. Second operand 3 states. [2019-12-27 02:04:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:00,335 INFO L93 Difference]: Finished difference Result 146539 states and 614385 transitions. [2019-12-27 02:04:00,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:04:00,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 02:04:00,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:00,954 INFO L225 Difference]: With dead ends: 146539 [2019-12-27 02:04:00,954 INFO L226 Difference]: Without dead ends: 146539 [2019-12-27 02:04:00,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:04:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146539 states. [2019-12-27 02:04:07,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146539 to 146539. [2019-12-27 02:04:07,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146539 states. [2019-12-27 02:04:07,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146539 states to 146539 states and 614385 transitions. [2019-12-27 02:04:07,776 INFO L78 Accepts]: Start accepts. Automaton has 146539 states and 614385 transitions. Word has length 15 [2019-12-27 02:04:07,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:07,776 INFO L462 AbstractCegarLoop]: Abstraction has 146539 states and 614385 transitions. [2019-12-27 02:04:07,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:04:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 146539 states and 614385 transitions. [2019-12-27 02:04:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:04:07,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:07,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:07,782 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:07,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:07,783 INFO L82 PathProgramCache]: Analyzing trace with hash -839885588, now seen corresponding path program 1 times [2019-12-27 02:04:07,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:07,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741180143] [2019-12-27 02:04:07,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:07,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741180143] [2019-12-27 02:04:07,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:07,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:04:07,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358837234] [2019-12-27 02:04:07,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:04:07,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:07,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:04:07,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:04:07,840 INFO L87 Difference]: Start difference. First operand 146539 states and 614385 transitions. Second operand 4 states. [2019-12-27 02:04:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:09,067 INFO L93 Difference]: Finished difference Result 40251 states and 143660 transitions. [2019-12-27 02:04:09,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:04:09,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:04:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:09,144 INFO L225 Difference]: With dead ends: 40251 [2019-12-27 02:04:09,144 INFO L226 Difference]: Without dead ends: 40251 [2019-12-27 02:04:09,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:04:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40251 states. [2019-12-27 02:04:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40251 to 40251. [2019-12-27 02:04:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40251 states. [2019-12-27 02:04:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40251 states to 40251 states and 143660 transitions. [2019-12-27 02:04:09,886 INFO L78 Accepts]: Start accepts. Automaton has 40251 states and 143660 transitions. Word has length 16 [2019-12-27 02:04:09,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:09,886 INFO L462 AbstractCegarLoop]: Abstraction has 40251 states and 143660 transitions. [2019-12-27 02:04:09,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:04:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 40251 states and 143660 transitions. [2019-12-27 02:04:09,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:04:09,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:09,889 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:09,889 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:09,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:09,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1627950887, now seen corresponding path program 1 times [2019-12-27 02:04:09,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:09,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509550908] [2019-12-27 02:04:09,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:10,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509550908] [2019-12-27 02:04:10,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:10,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:04:10,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913252762] [2019-12-27 02:04:10,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:04:10,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:10,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:04:10,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:04:10,021 INFO L87 Difference]: Start difference. First operand 40251 states and 143660 transitions. Second operand 5 states. [2019-12-27 02:04:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:10,573 INFO L93 Difference]: Finished difference Result 58215 states and 204121 transitions. [2019-12-27 02:04:10,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:04:10,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 02:04:10,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:13,518 INFO L225 Difference]: With dead ends: 58215 [2019-12-27 02:04:13,518 INFO L226 Difference]: Without dead ends: 58197 [2019-12-27 02:04:13,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:04:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58197 states. [2019-12-27 02:04:14,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58197 to 46455. [2019-12-27 02:04:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46455 states. [2019-12-27 02:04:14,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46455 states to 46455 states and 165104 transitions. [2019-12-27 02:04:14,447 INFO L78 Accepts]: Start accepts. Automaton has 46455 states and 165104 transitions. Word has length 16 [2019-12-27 02:04:14,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:14,447 INFO L462 AbstractCegarLoop]: Abstraction has 46455 states and 165104 transitions. [2019-12-27 02:04:14,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:04:14,448 INFO L276 IsEmpty]: Start isEmpty. Operand 46455 states and 165104 transitions. [2019-12-27 02:04:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 02:04:14,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:14,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:14,469 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:14,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:14,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1520730132, now seen corresponding path program 1 times [2019-12-27 02:04:14,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:14,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943802899] [2019-12-27 02:04:14,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:14,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943802899] [2019-12-27 02:04:14,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:14,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:04:14,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110354994] [2019-12-27 02:04:14,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:04:14,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:14,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:04:14,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:04:14,643 INFO L87 Difference]: Start difference. First operand 46455 states and 165104 transitions. Second operand 6 states. [2019-12-27 02:04:16,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:16,019 INFO L93 Difference]: Finished difference Result 73096 states and 253552 transitions. [2019-12-27 02:04:16,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:04:16,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 02:04:16,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:16,156 INFO L225 Difference]: With dead ends: 73096 [2019-12-27 02:04:16,157 INFO L226 Difference]: Without dead ends: 73066 [2019-12-27 02:04:16,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:04:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73066 states. [2019-12-27 02:04:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73066 to 50597. [2019-12-27 02:04:17,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50597 states. [2019-12-27 02:04:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50597 states to 50597 states and 178862 transitions. [2019-12-27 02:04:17,217 INFO L78 Accepts]: Start accepts. Automaton has 50597 states and 178862 transitions. Word has length 24 [2019-12-27 02:04:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:17,218 INFO L462 AbstractCegarLoop]: Abstraction has 50597 states and 178862 transitions. [2019-12-27 02:04:17,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:04:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 50597 states and 178862 transitions. [2019-12-27 02:04:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 02:04:17,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:17,233 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] [2019-12-27 02:04:17,233 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:17,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash -212678054, now seen corresponding path program 2 times [2019-12-27 02:04:17,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:17,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488811417] [2019-12-27 02:04:17,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:17,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488811417] [2019-12-27 02:04:17,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:17,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:04:17,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435354378] [2019-12-27 02:04:17,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:04:17,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:17,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:04:17,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:04:17,392 INFO L87 Difference]: Start difference. First operand 50597 states and 178862 transitions. Second operand 6 states. [2019-12-27 02:04:18,011 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-12-27 02:04:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:18,685 INFO L93 Difference]: Finished difference Result 73479 states and 253629 transitions. [2019-12-27 02:04:18,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:04:18,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 02:04:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:18,829 INFO L225 Difference]: With dead ends: 73479 [2019-12-27 02:04:18,829 INFO L226 Difference]: Without dead ends: 73449 [2019-12-27 02:04:18,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:04:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73449 states. [2019-12-27 02:04:19,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73449 to 48233. [2019-12-27 02:04:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48233 states. [2019-12-27 02:04:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48233 states to 48233 states and 170079 transitions. [2019-12-27 02:04:20,445 INFO L78 Accepts]: Start accepts. Automaton has 48233 states and 170079 transitions. Word has length 24 [2019-12-27 02:04:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:20,445 INFO L462 AbstractCegarLoop]: Abstraction has 48233 states and 170079 transitions. [2019-12-27 02:04:20,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:04:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 48233 states and 170079 transitions. [2019-12-27 02:04:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 02:04:20,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:20,472 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-27 02:04:20,472 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:20,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:20,473 INFO L82 PathProgramCache]: Analyzing trace with hash -560534453, now seen corresponding path program 1 times [2019-12-27 02:04:20,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:20,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504402601] [2019-12-27 02:04:20,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:20,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504402601] [2019-12-27 02:04:20,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:20,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:04:20,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198176116] [2019-12-27 02:04:20,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:04:20,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:20,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:04:20,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:04:20,542 INFO L87 Difference]: Start difference. First operand 48233 states and 170079 transitions. Second operand 5 states. [2019-12-27 02:04:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:20,673 INFO L93 Difference]: Finished difference Result 26235 states and 93816 transitions. [2019-12-27 02:04:20,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:04:20,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 02:04:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:20,725 INFO L225 Difference]: With dead ends: 26235 [2019-12-27 02:04:20,725 INFO L226 Difference]: Without dead ends: 26235 [2019-12-27 02:04:20,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:04:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26235 states. [2019-12-27 02:04:21,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26235 to 25835. [2019-12-27 02:04:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25835 states. [2019-12-27 02:04:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25835 states to 25835 states and 92456 transitions. [2019-12-27 02:04:21,201 INFO L78 Accepts]: Start accepts. Automaton has 25835 states and 92456 transitions. Word has length 28 [2019-12-27 02:04:21,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:21,202 INFO L462 AbstractCegarLoop]: Abstraction has 25835 states and 92456 transitions. [2019-12-27 02:04:21,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:04:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 25835 states and 92456 transitions. [2019-12-27 02:04:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 02:04:21,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:21,251 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] [2019-12-27 02:04:21,251 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:21,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:21,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1812552662, now seen corresponding path program 1 times [2019-12-27 02:04:21,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:21,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847440453] [2019-12-27 02:04:21,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:21,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847440453] [2019-12-27 02:04:21,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:21,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:04:21,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126692084] [2019-12-27 02:04:21,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:04:21,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:21,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:04:21,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:04:21,351 INFO L87 Difference]: Start difference. First operand 25835 states and 92456 transitions. Second operand 4 states. [2019-12-27 02:04:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:21,557 INFO L93 Difference]: Finished difference Result 37412 states and 127885 transitions. [2019-12-27 02:04:21,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:04:21,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 02:04:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:21,609 INFO L225 Difference]: With dead ends: 37412 [2019-12-27 02:04:21,609 INFO L226 Difference]: Without dead ends: 26234 [2019-12-27 02:04:21,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:04:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26234 states. [2019-12-27 02:04:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26234 to 26084. [2019-12-27 02:04:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26084 states. [2019-12-27 02:04:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26084 states to 26084 states and 92286 transitions. [2019-12-27 02:04:22,504 INFO L78 Accepts]: Start accepts. Automaton has 26084 states and 92286 transitions. Word has length 42 [2019-12-27 02:04:22,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:22,504 INFO L462 AbstractCegarLoop]: Abstraction has 26084 states and 92286 transitions. [2019-12-27 02:04:22,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:04:22,505 INFO L276 IsEmpty]: Start isEmpty. Operand 26084 states and 92286 transitions. [2019-12-27 02:04:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 02:04:22,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:22,545 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] [2019-12-27 02:04:22,545 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:22,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:22,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1574516846, now seen corresponding path program 2 times [2019-12-27 02:04:22,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:22,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333204204] [2019-12-27 02:04:22,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:22,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333204204] [2019-12-27 02:04:22,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:22,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:04:22,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588312630] [2019-12-27 02:04:22,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:04:22,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:22,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:04:22,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:04:22,607 INFO L87 Difference]: Start difference. First operand 26084 states and 92286 transitions. Second operand 3 states. [2019-12-27 02:04:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:22,808 INFO L93 Difference]: Finished difference Result 39452 states and 132645 transitions. [2019-12-27 02:04:22,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:04:22,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-27 02:04:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:22,862 INFO L225 Difference]: With dead ends: 39452 [2019-12-27 02:04:22,862 INFO L226 Difference]: Without dead ends: 26924 [2019-12-27 02:04:22,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:04:22,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26924 states. [2019-12-27 02:04:23,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26924 to 25835. [2019-12-27 02:04:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25835 states. [2019-12-27 02:04:23,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25835 states to 25835 states and 79997 transitions. [2019-12-27 02:04:23,313 INFO L78 Accepts]: Start accepts. Automaton has 25835 states and 79997 transitions. Word has length 42 [2019-12-27 02:04:23,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:23,314 INFO L462 AbstractCegarLoop]: Abstraction has 25835 states and 79997 transitions. [2019-12-27 02:04:23,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:04:23,314 INFO L276 IsEmpty]: Start isEmpty. Operand 25835 states and 79997 transitions. [2019-12-27 02:04:23,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 02:04:23,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:23,350 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] [2019-12-27 02:04:23,350 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:23,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:23,351 INFO L82 PathProgramCache]: Analyzing trace with hash 730447546, now seen corresponding path program 1 times [2019-12-27 02:04:23,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:23,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996935328] [2019-12-27 02:04:23,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:23,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996935328] [2019-12-27 02:04:23,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:23,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:04:23,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469424251] [2019-12-27 02:04:23,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:04:23,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:23,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:04:23,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:04:23,464 INFO L87 Difference]: Start difference. First operand 25835 states and 79997 transitions. Second operand 6 states. [2019-12-27 02:04:23,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:23,583 INFO L93 Difference]: Finished difference Result 24507 states and 76659 transitions. [2019-12-27 02:04:23,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:04:23,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-27 02:04:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:23,601 INFO L225 Difference]: With dead ends: 24507 [2019-12-27 02:04:23,601 INFO L226 Difference]: Without dead ends: 10719 [2019-12-27 02:04:23,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:04:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10719 states. [2019-12-27 02:04:23,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10719 to 10341. [2019-12-27 02:04:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10341 states. [2019-12-27 02:04:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10341 states to 10341 states and 32248 transitions. [2019-12-27 02:04:23,762 INFO L78 Accepts]: Start accepts. Automaton has 10341 states and 32248 transitions. Word has length 43 [2019-12-27 02:04:23,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:23,762 INFO L462 AbstractCegarLoop]: Abstraction has 10341 states and 32248 transitions. [2019-12-27 02:04:23,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:04:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 10341 states and 32248 transitions. [2019-12-27 02:04:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:04:23,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:23,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:23,778 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:23,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:23,778 INFO L82 PathProgramCache]: Analyzing trace with hash -360004126, now seen corresponding path program 1 times [2019-12-27 02:04:23,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:23,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556226748] [2019-12-27 02:04:23,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:23,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556226748] [2019-12-27 02:04:23,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:23,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:04:23,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372441149] [2019-12-27 02:04:23,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:04:23,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:23,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:04:23,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:04:23,840 INFO L87 Difference]: Start difference. First operand 10341 states and 32248 transitions. Second operand 3 states. [2019-12-27 02:04:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:23,928 INFO L93 Difference]: Finished difference Result 13894 states and 42635 transitions. [2019-12-27 02:04:23,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:04:23,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 02:04:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:23,953 INFO L225 Difference]: With dead ends: 13894 [2019-12-27 02:04:23,953 INFO L226 Difference]: Without dead ends: 13894 [2019-12-27 02:04:23,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:04:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13894 states. [2019-12-27 02:04:24,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13894 to 11246. [2019-12-27 02:04:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11246 states. [2019-12-27 02:04:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11246 states to 11246 states and 35029 transitions. [2019-12-27 02:04:24,205 INFO L78 Accepts]: Start accepts. Automaton has 11246 states and 35029 transitions. Word has length 57 [2019-12-27 02:04:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:24,206 INFO L462 AbstractCegarLoop]: Abstraction has 11246 states and 35029 transitions. [2019-12-27 02:04:24,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:04:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 11246 states and 35029 transitions. [2019-12-27 02:04:24,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:04:24,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:24,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:24,218 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:24,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:24,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1774753707, now seen corresponding path program 1 times [2019-12-27 02:04:24,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:24,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238012691] [2019-12-27 02:04:24,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:24,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238012691] [2019-12-27 02:04:24,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:24,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:04:24,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107106972] [2019-12-27 02:04:24,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:04:24,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:24,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:04:24,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:04:24,320 INFO L87 Difference]: Start difference. First operand 11246 states and 35029 transitions. Second operand 7 states. [2019-12-27 02:04:24,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:24,745 INFO L93 Difference]: Finished difference Result 31203 states and 96822 transitions. [2019-12-27 02:04:24,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:04:24,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 02:04:24,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:24,795 INFO L225 Difference]: With dead ends: 31203 [2019-12-27 02:04:24,795 INFO L226 Difference]: Without dead ends: 24459 [2019-12-27 02:04:24,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:04:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24459 states. [2019-12-27 02:04:25,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24459 to 14347. [2019-12-27 02:04:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14347 states. [2019-12-27 02:04:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14347 states to 14347 states and 45043 transitions. [2019-12-27 02:04:25,139 INFO L78 Accepts]: Start accepts. Automaton has 14347 states and 45043 transitions. Word has length 57 [2019-12-27 02:04:25,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:25,139 INFO L462 AbstractCegarLoop]: Abstraction has 14347 states and 45043 transitions. [2019-12-27 02:04:25,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:04:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 45043 transitions. [2019-12-27 02:04:25,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:04:25,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:25,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:25,156 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:25,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:25,156 INFO L82 PathProgramCache]: Analyzing trace with hash -70014025, now seen corresponding path program 2 times [2019-12-27 02:04:25,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:25,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154238095] [2019-12-27 02:04:25,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:25,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-27 02:04:25,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154238095] [2019-12-27 02:04:25,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:25,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:04:25,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730928937] [2019-12-27 02:04:25,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:04:25,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:25,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:04:25,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:04:25,253 INFO L87 Difference]: Start difference. First operand 14347 states and 45043 transitions. Second operand 6 states. [2019-12-27 02:04:25,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:25,597 INFO L93 Difference]: Finished difference Result 36806 states and 112743 transitions. [2019-12-27 02:04:25,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:04:25,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 02:04:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:25,636 INFO L225 Difference]: With dead ends: 36806 [2019-12-27 02:04:25,636 INFO L226 Difference]: Without dead ends: 26675 [2019-12-27 02:04:25,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:04:25,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26675 states. [2019-12-27 02:04:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26675 to 16874. [2019-12-27 02:04:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16874 states. [2019-12-27 02:04:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16874 states to 16874 states and 52931 transitions. [2019-12-27 02:04:25,983 INFO L78 Accepts]: Start accepts. Automaton has 16874 states and 52931 transitions. Word has length 57 [2019-12-27 02:04:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:25,984 INFO L462 AbstractCegarLoop]: Abstraction has 16874 states and 52931 transitions. [2019-12-27 02:04:25,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:04:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 16874 states and 52931 transitions. [2019-12-27 02:04:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:04:26,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:26,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:26,004 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:26,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:26,004 INFO L82 PathProgramCache]: Analyzing trace with hash -766414125, now seen corresponding path program 3 times [2019-12-27 02:04:26,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:26,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836194695] [2019-12-27 02:04:26,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:26,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836194695] [2019-12-27 02:04:26,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:26,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:04:26,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175781494] [2019-12-27 02:04:26,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:04:26,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:26,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:04:26,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:04:26,116 INFO L87 Difference]: Start difference. First operand 16874 states and 52931 transitions. Second operand 7 states. [2019-12-27 02:04:26,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:26,569 INFO L93 Difference]: Finished difference Result 29867 states and 90934 transitions. [2019-12-27 02:04:26,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 02:04:26,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 02:04:26,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:26,610 INFO L225 Difference]: With dead ends: 29867 [2019-12-27 02:04:26,610 INFO L226 Difference]: Without dead ends: 27808 [2019-12-27 02:04:26,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:04:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27808 states. [2019-12-27 02:04:26,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27808 to 16938. [2019-12-27 02:04:26,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-27 02:04:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 53162 transitions. [2019-12-27 02:04:26,952 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 53162 transitions. Word has length 57 [2019-12-27 02:04:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:26,952 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 53162 transitions. [2019-12-27 02:04:26,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:04:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 53162 transitions. [2019-12-27 02:04:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:04:26,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:26,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:26,971 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:26,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:26,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1761143536, now seen corresponding path program 1 times [2019-12-27 02:04:26,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:26,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217812788] [2019-12-27 02:04:26,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:27,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217812788] [2019-12-27 02:04:27,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:27,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:04:27,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260295428] [2019-12-27 02:04:27,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:04:27,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:27,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:04:27,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:04:27,023 INFO L87 Difference]: Start difference. First operand 16938 states and 53162 transitions. Second operand 3 states. [2019-12-27 02:04:27,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:27,161 INFO L93 Difference]: Finished difference Result 18741 states and 57074 transitions. [2019-12-27 02:04:27,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:04:27,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 02:04:27,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:27,195 INFO L225 Difference]: With dead ends: 18741 [2019-12-27 02:04:27,195 INFO L226 Difference]: Without dead ends: 18741 [2019-12-27 02:04:27,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:04:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18741 states. [2019-12-27 02:04:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18741 to 16938. [2019-12-27 02:04:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-27 02:04:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 51972 transitions. [2019-12-27 02:04:27,646 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 51972 transitions. Word has length 57 [2019-12-27 02:04:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:27,646 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 51972 transitions. [2019-12-27 02:04:27,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:04:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 51972 transitions. [2019-12-27 02:04:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:04:27,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:27,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:27,681 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:27,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:27,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1904135869, now seen corresponding path program 4 times [2019-12-27 02:04:27,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:27,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108551541] [2019-12-27 02:04:27,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:27,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108551541] [2019-12-27 02:04:27,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:27,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:04:27,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034670971] [2019-12-27 02:04:27,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:04:27,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:27,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:04:27,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:04:27,785 INFO L87 Difference]: Start difference. First operand 16938 states and 51972 transitions. Second operand 7 states. [2019-12-27 02:04:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:28,194 INFO L93 Difference]: Finished difference Result 33067 states and 98644 transitions. [2019-12-27 02:04:28,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:04:28,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 02:04:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:28,234 INFO L225 Difference]: With dead ends: 33067 [2019-12-27 02:04:28,235 INFO L226 Difference]: Without dead ends: 27923 [2019-12-27 02:04:28,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:04:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27923 states. [2019-12-27 02:04:28,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27923 to 17148. [2019-12-27 02:04:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17148 states. [2019-12-27 02:04:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17148 states to 17148 states and 52559 transitions. [2019-12-27 02:04:28,713 INFO L78 Accepts]: Start accepts. Automaton has 17148 states and 52559 transitions. Word has length 57 [2019-12-27 02:04:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:28,714 INFO L462 AbstractCegarLoop]: Abstraction has 17148 states and 52559 transitions. [2019-12-27 02:04:28,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:04:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 17148 states and 52559 transitions. [2019-12-27 02:04:28,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:04:28,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:28,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:28,734 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:28,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:28,734 INFO L82 PathProgramCache]: Analyzing trace with hash -576788017, now seen corresponding path program 5 times [2019-12-27 02:04:28,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:28,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914010730] [2019-12-27 02:04:28,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:28,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914010730] [2019-12-27 02:04:28,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:28,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:04:28,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061352003] [2019-12-27 02:04:28,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:04:28,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:28,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:04:28,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:04:28,825 INFO L87 Difference]: Start difference. First operand 17148 states and 52559 transitions. Second operand 5 states. [2019-12-27 02:04:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:29,310 INFO L93 Difference]: Finished difference Result 26314 states and 78268 transitions. [2019-12-27 02:04:29,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:04:29,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 02:04:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:29,350 INFO L225 Difference]: With dead ends: 26314 [2019-12-27 02:04:29,350 INFO L226 Difference]: Without dead ends: 26188 [2019-12-27 02:04:29,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:04:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26188 states. [2019-12-27 02:04:29,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26188 to 20073. [2019-12-27 02:04:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20073 states. [2019-12-27 02:04:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 61009 transitions. [2019-12-27 02:04:29,695 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 61009 transitions. Word has length 57 [2019-12-27 02:04:29,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:29,695 INFO L462 AbstractCegarLoop]: Abstraction has 20073 states and 61009 transitions. [2019-12-27 02:04:29,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:04:29,695 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 61009 transitions. [2019-12-27 02:04:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:04:29,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:29,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:29,718 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:29,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:29,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1952605815, now seen corresponding path program 6 times [2019-12-27 02:04:29,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:29,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037930279] [2019-12-27 02:04:29,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:29,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037930279] [2019-12-27 02:04:29,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:29,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:04:29,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291101683] [2019-12-27 02:04:29,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:04:29,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:29,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:04:29,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:04:29,862 INFO L87 Difference]: Start difference. First operand 20073 states and 61009 transitions. Second operand 8 states. [2019-12-27 02:04:30,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:30,803 INFO L93 Difference]: Finished difference Result 27381 states and 81339 transitions. [2019-12-27 02:04:30,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 02:04:30,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-27 02:04:30,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:30,841 INFO L225 Difference]: With dead ends: 27381 [2019-12-27 02:04:30,841 INFO L226 Difference]: Without dead ends: 27381 [2019-12-27 02:04:30,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:04:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27381 states. [2019-12-27 02:04:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27381 to 20271. [2019-12-27 02:04:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20271 states. [2019-12-27 02:04:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20271 states to 20271 states and 61591 transitions. [2019-12-27 02:04:31,342 INFO L78 Accepts]: Start accepts. Automaton has 20271 states and 61591 transitions. Word has length 57 [2019-12-27 02:04:31,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:31,342 INFO L462 AbstractCegarLoop]: Abstraction has 20271 states and 61591 transitions. [2019-12-27 02:04:31,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:04:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 20271 states and 61591 transitions. [2019-12-27 02:04:31,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:04:31,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:31,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:31,365 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:31,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:31,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2126429955, now seen corresponding path program 7 times [2019-12-27 02:04:31,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:31,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956664614] [2019-12-27 02:04:31,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:31,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956664614] [2019-12-27 02:04:31,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:31,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:04:31,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130336312] [2019-12-27 02:04:31,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:04:31,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:31,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:04:31,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:04:31,527 INFO L87 Difference]: Start difference. First operand 20271 states and 61591 transitions. Second operand 9 states. [2019-12-27 02:04:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:32,736 INFO L93 Difference]: Finished difference Result 29033 states and 85853 transitions. [2019-12-27 02:04:32,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 02:04:32,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 02:04:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:32,777 INFO L225 Difference]: With dead ends: 29033 [2019-12-27 02:04:32,777 INFO L226 Difference]: Without dead ends: 29033 [2019-12-27 02:04:32,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-12-27 02:04:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29033 states. [2019-12-27 02:04:33,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29033 to 23020. [2019-12-27 02:04:33,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23020 states. [2019-12-27 02:04:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23020 states to 23020 states and 69387 transitions. [2019-12-27 02:04:33,184 INFO L78 Accepts]: Start accepts. Automaton has 23020 states and 69387 transitions. Word has length 57 [2019-12-27 02:04:33,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:33,185 INFO L462 AbstractCegarLoop]: Abstraction has 23020 states and 69387 transitions. [2019-12-27 02:04:33,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:04:33,185 INFO L276 IsEmpty]: Start isEmpty. Operand 23020 states and 69387 transitions. [2019-12-27 02:04:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:04:33,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:33,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:33,212 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1809878711, now seen corresponding path program 8 times [2019-12-27 02:04:33,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:33,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598166398] [2019-12-27 02:04:33,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:33,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598166398] [2019-12-27 02:04:33,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:33,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:04:33,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300196982] [2019-12-27 02:04:33,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:04:33,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:33,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:04:33,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:04:33,364 INFO L87 Difference]: Start difference. First operand 23020 states and 69387 transitions. Second operand 9 states. [2019-12-27 02:04:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:34,689 INFO L93 Difference]: Finished difference Result 35444 states and 103738 transitions. [2019-12-27 02:04:34,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 02:04:34,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 02:04:34,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:34,737 INFO L225 Difference]: With dead ends: 35444 [2019-12-27 02:04:34,737 INFO L226 Difference]: Without dead ends: 35156 [2019-12-27 02:04:34,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:04:34,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35156 states. [2019-12-27 02:04:35,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35156 to 25598. [2019-12-27 02:04:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25598 states. [2019-12-27 02:04:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25598 states to 25598 states and 76158 transitions. [2019-12-27 02:04:35,326 INFO L78 Accepts]: Start accepts. Automaton has 25598 states and 76158 transitions. Word has length 57 [2019-12-27 02:04:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:35,327 INFO L462 AbstractCegarLoop]: Abstraction has 25598 states and 76158 transitions. [2019-12-27 02:04:35,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:04:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 25598 states and 76158 transitions. [2019-12-27 02:04:35,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:04:35,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:35,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:35,352 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:35,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:35,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1326524261, now seen corresponding path program 9 times [2019-12-27 02:04:35,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:35,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74404386] [2019-12-27 02:04:35,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:35,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74404386] [2019-12-27 02:04:35,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:35,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:04:35,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39782292] [2019-12-27 02:04:35,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:04:35,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:35,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:04:35,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:04:35,509 INFO L87 Difference]: Start difference. First operand 25598 states and 76158 transitions. Second operand 10 states. [2019-12-27 02:04:37,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:37,290 INFO L93 Difference]: Finished difference Result 43300 states and 126781 transitions. [2019-12-27 02:04:37,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:04:37,290 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-12-27 02:04:37,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:37,355 INFO L225 Difference]: With dead ends: 43300 [2019-12-27 02:04:37,355 INFO L226 Difference]: Without dead ends: 43111 [2019-12-27 02:04:37,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2019-12-27 02:04:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43111 states. [2019-12-27 02:04:38,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43111 to 26559. [2019-12-27 02:04:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26559 states. [2019-12-27 02:04:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26559 states to 26559 states and 79086 transitions. [2019-12-27 02:04:38,068 INFO L78 Accepts]: Start accepts. Automaton has 26559 states and 79086 transitions. Word has length 57 [2019-12-27 02:04:38,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:38,068 INFO L462 AbstractCegarLoop]: Abstraction has 26559 states and 79086 transitions. [2019-12-27 02:04:38,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:04:38,068 INFO L276 IsEmpty]: Start isEmpty. Operand 26559 states and 79086 transitions. [2019-12-27 02:04:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:04:38,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:38,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:38,100 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:38,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:38,101 INFO L82 PathProgramCache]: Analyzing trace with hash 99843907, now seen corresponding path program 10 times [2019-12-27 02:04:38,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:38,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363441488] [2019-12-27 02:04:38,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:38,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-27 02:04:38,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363441488] [2019-12-27 02:04:38,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:38,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:04:38,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311244693] [2019-12-27 02:04:38,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:04:38,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:38,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:04:38,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:04:38,253 INFO L87 Difference]: Start difference. First operand 26559 states and 79086 transitions. Second operand 10 states. [2019-12-27 02:04:40,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:40,921 INFO L93 Difference]: Finished difference Result 42765 states and 124715 transitions. [2019-12-27 02:04:40,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 02:04:40,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-12-27 02:04:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:40,985 INFO L225 Difference]: With dead ends: 42765 [2019-12-27 02:04:40,986 INFO L226 Difference]: Without dead ends: 42543 [2019-12-27 02:04:40,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=832, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 02:04:41,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42543 states. [2019-12-27 02:04:41,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42543 to 26419. [2019-12-27 02:04:41,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26419 states. [2019-12-27 02:04:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26419 states to 26419 states and 78660 transitions. [2019-12-27 02:04:41,882 INFO L78 Accepts]: Start accepts. Automaton has 26419 states and 78660 transitions. Word has length 57 [2019-12-27 02:04:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:41,882 INFO L462 AbstractCegarLoop]: Abstraction has 26419 states and 78660 transitions. [2019-12-27 02:04:41,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:04:41,882 INFO L276 IsEmpty]: Start isEmpty. Operand 26419 states and 78660 transitions. [2019-12-27 02:04:41,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:04:41,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:41,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:41,915 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:41,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:41,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2075339129, now seen corresponding path program 11 times [2019-12-27 02:04:41,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:41,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277753539] [2019-12-27 02:04:41,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:41,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277753539] [2019-12-27 02:04:41,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:41,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:04:41,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990961261] [2019-12-27 02:04:42,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:04:42,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:42,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:04:42,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:04:42,002 INFO L87 Difference]: Start difference. First operand 26419 states and 78660 transitions. Second operand 7 states. [2019-12-27 02:04:43,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:43,167 INFO L93 Difference]: Finished difference Result 37944 states and 110419 transitions. [2019-12-27 02:04:43,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 02:04:43,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 02:04:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:43,224 INFO L225 Difference]: With dead ends: 37944 [2019-12-27 02:04:43,224 INFO L226 Difference]: Without dead ends: 37944 [2019-12-27 02:04:43,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:04:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37944 states. [2019-12-27 02:04:43,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37944 to 25437. [2019-12-27 02:04:43,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25437 states. [2019-12-27 02:04:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25437 states to 25437 states and 75843 transitions. [2019-12-27 02:04:43,734 INFO L78 Accepts]: Start accepts. Automaton has 25437 states and 75843 transitions. Word has length 57 [2019-12-27 02:04:43,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:43,735 INFO L462 AbstractCegarLoop]: Abstraction has 25437 states and 75843 transitions. [2019-12-27 02:04:43,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:04:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 25437 states and 75843 transitions. [2019-12-27 02:04:43,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:04:43,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:43,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:43,779 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:43,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:43,779 INFO L82 PathProgramCache]: Analyzing trace with hash 817096895, now seen corresponding path program 12 times [2019-12-27 02:04:43,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:43,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025609124] [2019-12-27 02:04:43,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:43,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025609124] [2019-12-27 02:04:43,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:43,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:04:43,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676788241] [2019-12-27 02:04:43,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:04:43,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:43,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:04:43,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:04:43,910 INFO L87 Difference]: Start difference. First operand 25437 states and 75843 transitions. Second operand 9 states. [2019-12-27 02:04:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:45,679 INFO L93 Difference]: Finished difference Result 37812 states and 110017 transitions. [2019-12-27 02:04:45,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 02:04:45,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 02:04:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:45,725 INFO L225 Difference]: With dead ends: 37812 [2019-12-27 02:04:45,725 INFO L226 Difference]: Without dead ends: 37812 [2019-12-27 02:04:45,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:04:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37812 states. [2019-12-27 02:04:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37812 to 22732. [2019-12-27 02:04:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22732 states. [2019-12-27 02:04:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22732 states to 22732 states and 67894 transitions. [2019-12-27 02:04:46,142 INFO L78 Accepts]: Start accepts. Automaton has 22732 states and 67894 transitions. Word has length 57 [2019-12-27 02:04:46,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:46,143 INFO L462 AbstractCegarLoop]: Abstraction has 22732 states and 67894 transitions. [2019-12-27 02:04:46,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:04:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 22732 states and 67894 transitions. [2019-12-27 02:04:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:04:46,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:46,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:46,168 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:46,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:46,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1385383185, now seen corresponding path program 13 times [2019-12-27 02:04:46,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:46,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361271262] [2019-12-27 02:04:46,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:46,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361271262] [2019-12-27 02:04:46,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:46,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:04:46,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219685297] [2019-12-27 02:04:46,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:04:46,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:46,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:04:46,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:04:46,298 INFO L87 Difference]: Start difference. First operand 22732 states and 67894 transitions. Second operand 9 states. [2019-12-27 02:04:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:47,504 INFO L93 Difference]: Finished difference Result 41811 states and 123811 transitions. [2019-12-27 02:04:47,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 02:04:47,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 02:04:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:47,563 INFO L225 Difference]: With dead ends: 41811 [2019-12-27 02:04:47,563 INFO L226 Difference]: Without dead ends: 41699 [2019-12-27 02:04:47,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-27 02:04:47,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41699 states. [2019-12-27 02:04:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41699 to 24829. [2019-12-27 02:04:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24829 states. [2019-12-27 02:04:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24829 states to 24829 states and 74272 transitions. [2019-12-27 02:04:48,072 INFO L78 Accepts]: Start accepts. Automaton has 24829 states and 74272 transitions. Word has length 57 [2019-12-27 02:04:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:48,073 INFO L462 AbstractCegarLoop]: Abstraction has 24829 states and 74272 transitions. [2019-12-27 02:04:48,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:04:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 24829 states and 74272 transitions. [2019-12-27 02:04:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:04:48,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:48,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:48,098 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:48,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:48,285 INFO L82 PathProgramCache]: Analyzing trace with hash 226977995, now seen corresponding path program 14 times [2019-12-27 02:04:48,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:48,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173043394] [2019-12-27 02:04:48,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:48,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173043394] [2019-12-27 02:04:48,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:48,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:04:48,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992334233] [2019-12-27 02:04:48,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:04:48,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:48,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:04:48,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:04:48,361 INFO L87 Difference]: Start difference. First operand 24829 states and 74272 transitions. Second operand 3 states. [2019-12-27 02:04:48,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:48,448 INFO L93 Difference]: Finished difference Result 19478 states and 57695 transitions. [2019-12-27 02:04:48,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:04:48,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 02:04:48,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:48,491 INFO L225 Difference]: With dead ends: 19478 [2019-12-27 02:04:48,492 INFO L226 Difference]: Without dead ends: 19478 [2019-12-27 02:04:48,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:04:48,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19478 states. [2019-12-27 02:04:48,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19478 to 18971. [2019-12-27 02:04:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18971 states. [2019-12-27 02:04:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18971 states to 18971 states and 56167 transitions. [2019-12-27 02:04:48,960 INFO L78 Accepts]: Start accepts. Automaton has 18971 states and 56167 transitions. Word has length 57 [2019-12-27 02:04:48,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:48,960 INFO L462 AbstractCegarLoop]: Abstraction has 18971 states and 56167 transitions. [2019-12-27 02:04:48,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:04:48,960 INFO L276 IsEmpty]: Start isEmpty. Operand 18971 states and 56167 transitions. [2019-12-27 02:04:48,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 02:04:48,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:48,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:48,979 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:48,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:48,980 INFO L82 PathProgramCache]: Analyzing trace with hash 49311194, now seen corresponding path program 1 times [2019-12-27 02:04:48,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:48,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904976304] [2019-12-27 02:04:48,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:49,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:49,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904976304] [2019-12-27 02:04:49,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:49,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 02:04:49,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131368178] [2019-12-27 02:04:49,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:04:49,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:49,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:04:49,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:04:49,313 INFO L87 Difference]: Start difference. First operand 18971 states and 56167 transitions. Second operand 12 states. [2019-12-27 02:04:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:53,127 INFO L93 Difference]: Finished difference Result 41883 states and 120967 transitions. [2019-12-27 02:04:53,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 02:04:53,127 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-12-27 02:04:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:53,183 INFO L225 Difference]: With dead ends: 41883 [2019-12-27 02:04:53,183 INFO L226 Difference]: Without dead ends: 41883 [2019-12-27 02:04:53,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=449, Invalid=1807, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 02:04:53,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41883 states. [2019-12-27 02:04:53,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41883 to 20766. [2019-12-27 02:04:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20766 states. [2019-12-27 02:04:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20766 states to 20766 states and 62068 transitions. [2019-12-27 02:04:53,772 INFO L78 Accepts]: Start accepts. Automaton has 20766 states and 62068 transitions. Word has length 58 [2019-12-27 02:04:53,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:53,772 INFO L462 AbstractCegarLoop]: Abstraction has 20766 states and 62068 transitions. [2019-12-27 02:04:53,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:04:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 20766 states and 62068 transitions. [2019-12-27 02:04:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 02:04:53,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:53,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:53,792 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:53,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:53,792 INFO L82 PathProgramCache]: Analyzing trace with hash 523765896, now seen corresponding path program 2 times [2019-12-27 02:04:53,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:53,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291569571] [2019-12-27 02:04:53,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:53,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-27 02:04:53,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291569571] [2019-12-27 02:04:53,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:53,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:04:53,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102382314] [2019-12-27 02:04:53,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:04:53,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:53,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:04:53,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:04:53,944 INFO L87 Difference]: Start difference. First operand 20766 states and 62068 transitions. Second operand 9 states. [2019-12-27 02:04:55,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:55,855 INFO L93 Difference]: Finished difference Result 35974 states and 105856 transitions. [2019-12-27 02:04:55,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 02:04:55,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-12-27 02:04:55,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:55,909 INFO L225 Difference]: With dead ends: 35974 [2019-12-27 02:04:55,909 INFO L226 Difference]: Without dead ends: 35848 [2019-12-27 02:04:55,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:04:56,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35848 states. [2019-12-27 02:04:56,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35848 to 22710. [2019-12-27 02:04:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22710 states. [2019-12-27 02:04:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22710 states to 22710 states and 68199 transitions. [2019-12-27 02:04:56,392 INFO L78 Accepts]: Start accepts. Automaton has 22710 states and 68199 transitions. Word has length 58 [2019-12-27 02:04:56,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:56,392 INFO L462 AbstractCegarLoop]: Abstraction has 22710 states and 68199 transitions. [2019-12-27 02:04:56,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:04:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 22710 states and 68199 transitions. [2019-12-27 02:04:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 02:04:56,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:56,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:04:56,419 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:56,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:56,420 INFO L82 PathProgramCache]: Analyzing trace with hash 947432764, now seen corresponding path program 3 times [2019-12-27 02:04:56,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:56,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970212615] [2019-12-27 02:04:56,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:04:56,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:04:56,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970212615] [2019-12-27 02:04:56,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:04:56,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:04:56,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766115440] [2019-12-27 02:04:56,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:04:56,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:04:56,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:04:56,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:04:56,480 INFO L87 Difference]: Start difference. First operand 22710 states and 68199 transitions. Second operand 3 states. [2019-12-27 02:04:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:04:56,574 INFO L93 Difference]: Finished difference Result 22710 states and 68197 transitions. [2019-12-27 02:04:56,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:04:56,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 02:04:56,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:04:56,606 INFO L225 Difference]: With dead ends: 22710 [2019-12-27 02:04:56,607 INFO L226 Difference]: Without dead ends: 22710 [2019-12-27 02:04:56,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:04:56,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22710 states. [2019-12-27 02:04:57,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22710 to 17534. [2019-12-27 02:04:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17534 states. [2019-12-27 02:04:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17534 states to 17534 states and 53178 transitions. [2019-12-27 02:04:57,064 INFO L78 Accepts]: Start accepts. Automaton has 17534 states and 53178 transitions. Word has length 58 [2019-12-27 02:04:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:04:57,065 INFO L462 AbstractCegarLoop]: Abstraction has 17534 states and 53178 transitions. [2019-12-27 02:04:57,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:04:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 17534 states and 53178 transitions. [2019-12-27 02:04:57,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 02:04:57,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:04:57,087 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] [2019-12-27 02:04:57,087 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:04:57,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:04:57,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1265178387, now seen corresponding path program 1 times [2019-12-27 02:04:57,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:04:57,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220517575] [2019-12-27 02:04:57,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:04:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:04:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:04:57,224 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:04:57,225 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:04:57,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$mem_tmp~0_52 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t717~0.base_21|) 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t717~0.base_21| 4) |v_#length_29|) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff1_thd0~0_155 0) (= v_~y$r_buff0_thd0~0_159 0) (= v_~y$w_buff1_used~0_637 0) (= v_~y$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_27) (= 0 v_~y$r_buff1_thd3~0_151) (= 0 v_~y$r_buff0_thd4~0_154) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_p3_EAX~0_27) (= 0 v_~y$r_buff0_thd2~0_336) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t717~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t717~0.base_21|) |v_ULTIMATE.start_main_~#t717~0.offset_16| 0)) |v_#memory_int_27|) (= 0 v_~y$r_buff1_thd4~0_190) (= (store .cse0 |v_ULTIMATE.start_main_~#t717~0.base_21| 1) |v_#valid_66|) (= v_~y~0_177 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$flush_delayed~0_106 0) (= v_~weak$$choice2~0_150 0) (= v_~y$w_buff1~0_392 0) (= 0 v_~y$r_buff1_thd2~0_255) (= 0 v_~y$r_buff0_thd3~0_211) (= v_~a~0_32 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t717~0.base_21|) (= v_~__unbuffered_cnt~0_242 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_105 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p1_EAX~0_27) (= 0 |v_ULTIMATE.start_main_~#t717~0.offset_16|) (= v_~y$w_buff0_used~0_880 0) (= 0 v_~y$w_buff0~0_485) (= 0 v_~weak$$choice0~0_13) (= 0 v_~y$r_buff1_thd1~0_85) (= v_~y$r_buff0_thd1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t719~0.offset=|v_ULTIMATE.start_main_~#t719~0.offset_17|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_92|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ULTIMATE.start_main_~#t720~0.base=|v_ULTIMATE.start_main_~#t720~0.base_22|, ~a~0=v_~a~0_32, ~y$mem_tmp~0=v_~y$mem_tmp~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_151, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_27, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t717~0.offset=|v_ULTIMATE.start_main_~#t717~0.offset_16|, ULTIMATE.start_main_~#t720~0.offset=|v_ULTIMATE.start_main_~#t720~0.offset_17|, ULTIMATE.start_main_~#t718~0.base=|v_ULTIMATE.start_main_~#t718~0.base_21|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_190, ~y$w_buff1~0=v_~y$w_buff1~0_392, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t717~0.base=|v_ULTIMATE.start_main_~#t717~0.base_21|, ULTIMATE.start_main_~#t718~0.offset=|v_ULTIMATE.start_main_~#t718~0.offset_17|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~x~0=v_~x~0_47, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_880, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_52|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_52|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_211, ULTIMATE.start_main_~#t719~0.base=|v_ULTIMATE.start_main_~#t719~0.base_22|, ~y~0=v_~y~0_177, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_27, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_255, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_154, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_637} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t719~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t720~0.base, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t717~0.offset, ULTIMATE.start_main_~#t720~0.offset, ULTIMATE.start_main_~#t718~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t717~0.base, ULTIMATE.start_main_~#t718~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t719~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 02:04:57,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L841-1-->L843: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t718~0.base_10|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t718~0.base_10| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t718~0.base_10|) |v_ULTIMATE.start_main_~#t718~0.offset_10| 1)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t718~0.base_10|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t718~0.base_10| 4) |v_#length_23|) (= 0 |v_ULTIMATE.start_main_~#t718~0.offset_10|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t718~0.base_10| 1) |v_#valid_41|) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t718~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t718~0.offset=|v_ULTIMATE.start_main_~#t718~0.offset_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t718~0.base=|v_ULTIMATE.start_main_~#t718~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t718~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t718~0.base] because there is no mapped edge [2019-12-27 02:04:57,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t719~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t719~0.offset_10|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t719~0.base_11| 4)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t719~0.base_11| 1)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t719~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t719~0.base_11| 0)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t719~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t719~0.base_11|) |v_ULTIMATE.start_main_~#t719~0.offset_10| 2)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t719~0.base=|v_ULTIMATE.start_main_~#t719~0.base_11|, ULTIMATE.start_main_~#t719~0.offset=|v_ULTIMATE.start_main_~#t719~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t719~0.base, ULTIMATE.start_main_~#t719~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 02:04:57,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L795: Formula: (and (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42 0)) (= v_~y$r_buff0_thd3~0_44 1) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd4~0_33 v_~y$r_buff1_thd4~0_33) (= v_~y$r_buff0_thd3~0_45 v_~y$r_buff1_thd3~0_21) (= v_~z~0_14 1) (= v_~y$r_buff0_thd0~0_33 v_~y$r_buff1_thd0~0_32)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_44, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 02:04:57,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L845-1-->L847: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t720~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t720~0.base_11|) |v_ULTIMATE.start_main_~#t720~0.offset_10| 3)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t720~0.offset_10| 0) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t720~0.base_11| 1)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t720~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t720~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t720~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t720~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t720~0.base=|v_ULTIMATE.start_main_~#t720~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t720~0.offset=|v_ULTIMATE.start_main_~#t720~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t720~0.base, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t720~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 02:04:57,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-2-->L818-5: Formula: (let ((.cse2 (= |P3Thread1of1ForFork0_#t~ite32_Out398753876| |P3Thread1of1ForFork0_#t~ite33_Out398753876|)) (.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In398753876 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In398753876 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite32_Out398753876| ~y$w_buff1~0_In398753876) (not .cse0) (not .cse1) .cse2) (and (= |P3Thread1of1ForFork0_#t~ite32_Out398753876| ~y~0_In398753876) .cse2 (or .cse1 .cse0)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In398753876, ~y$w_buff1~0=~y$w_buff1~0_In398753876, ~y~0=~y~0_In398753876, ~y$w_buff1_used~0=~y$w_buff1_used~0_In398753876} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In398753876, ~y$w_buff1~0=~y$w_buff1~0_In398753876, ~y~0=~y~0_In398753876, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out398753876|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out398753876|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In398753876} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 02:04:57,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~a~0_20 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a~0=v_~a~0_20, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_28, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 02:04:57,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1504945856 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-1504945856 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out-1504945856| ~y$w_buff0_used~0_In-1504945856)) (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite34_Out-1504945856| 0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1504945856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1504945856} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1504945856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1504945856, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-1504945856|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 02:04:57,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-419523137 256))) (.cse1 (= (mod ~y$r_buff1_thd4~0_In-419523137 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-419523137 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd4~0_In-419523137 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-419523137 |P3Thread1of1ForFork0_#t~ite35_Out-419523137|) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out-419523137|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-419523137, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-419523137, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-419523137, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-419523137} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-419523137, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-419523137, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-419523137, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-419523137|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-419523137} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-27 02:04:57,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd4~0_In2059304919 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In2059304919 256) 0))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out2059304919| 0)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out2059304919| ~y$r_buff0_thd4~0_In2059304919)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2059304919, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2059304919} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2059304919, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2059304919, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out2059304919|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 02:04:57,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In447338207 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In447338207 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd4~0_In447338207 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In447338207 256) 0))) (or (and (= ~y$r_buff1_thd4~0_In447338207 |P3Thread1of1ForFork0_#t~ite37_Out447338207|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork0_#t~ite37_Out447338207|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In447338207, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In447338207, ~y$w_buff0_used~0=~y$w_buff0_used~0_In447338207, ~y$w_buff1_used~0=~y$w_buff1_used~0_In447338207} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In447338207, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In447338207, ~y$w_buff0_used~0=~y$w_buff0_used~0_In447338207, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out447338207|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In447338207} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-27 02:04:57,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_42| v_~y$r_buff1_thd4~0_62) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_62, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_41|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:04:57,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In435440121 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out435440121| ~y$w_buff1~0_In435440121) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_In435440121| |P1Thread1of1ForFork2_#t~ite11_Out435440121|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In435440121 256)))) (or (= (mod ~y$w_buff0_used~0_In435440121 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In435440121 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In435440121 256))))) .cse0 (= ~y$w_buff1~0_In435440121 |P1Thread1of1ForFork2_#t~ite11_Out435440121|) (= |P1Thread1of1ForFork2_#t~ite12_Out435440121| |P1Thread1of1ForFork2_#t~ite11_Out435440121|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In435440121, ~y$w_buff1~0=~y$w_buff1~0_In435440121, ~y$w_buff0_used~0=~y$w_buff0_used~0_In435440121, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In435440121, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In435440121|, ~weak$$choice2~0=~weak$$choice2~0_In435440121, ~y$w_buff1_used~0=~y$w_buff1_used~0_In435440121} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In435440121, ~y$w_buff1~0=~y$w_buff1~0_In435440121, ~y$w_buff0_used~0=~y$w_buff0_used~0_In435440121, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In435440121, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out435440121|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out435440121|, ~weak$$choice2~0=~weak$$choice2~0_In435440121, ~y$w_buff1_used~0=~y$w_buff1_used~0_In435440121} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 02:04:57,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L761-->L761-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In50835319 256)))) (or (and (= ~y$w_buff0_used~0_In50835319 |P1Thread1of1ForFork2_#t~ite14_Out50835319|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In50835319 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In50835319 256)) (and (= (mod ~y$w_buff1_used~0_In50835319 256) 0) .cse0) (and (= 0 (mod ~y$r_buff1_thd2~0_In50835319 256)) .cse0))) (= |P1Thread1of1ForFork2_#t~ite15_Out50835319| |P1Thread1of1ForFork2_#t~ite14_Out50835319|) .cse1) (and (= |P1Thread1of1ForFork2_#t~ite14_In50835319| |P1Thread1of1ForFork2_#t~ite14_Out50835319|) (= ~y$w_buff0_used~0_In50835319 |P1Thread1of1ForFork2_#t~ite15_Out50835319|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In50835319, ~y$w_buff0_used~0=~y$w_buff0_used~0_In50835319, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In50835319, ~weak$$choice2~0=~weak$$choice2~0_In50835319, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In50835319|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In50835319} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In50835319, ~y$w_buff0_used~0=~y$w_buff0_used~0_In50835319, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In50835319, ~weak$$choice2~0=~weak$$choice2~0_In50835319, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out50835319|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out50835319|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In50835319} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 02:04:57,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L764: Formula: (and (= v_~y$r_buff0_thd2~0_95 v_~y$r_buff0_thd2~0_94) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_94, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 02:04:57,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1762619022 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite23_Out1762619022| |P1Thread1of1ForFork2_#t~ite24_Out1762619022|) (= |P1Thread1of1ForFork2_#t~ite23_Out1762619022| ~y$r_buff1_thd2~0_In1762619022) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1762619022 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1762619022 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1762619022 256))) (and (= 0 (mod ~y$r_buff1_thd2~0_In1762619022 256)) .cse1)))) (and (= |P1Thread1of1ForFork2_#t~ite24_Out1762619022| ~y$r_buff1_thd2~0_In1762619022) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite23_In1762619022| |P1Thread1of1ForFork2_#t~ite23_Out1762619022|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1762619022, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1762619022, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1762619022, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In1762619022|, ~weak$$choice2~0=~weak$$choice2~0_In1762619022, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1762619022} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1762619022, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1762619022, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1762619022, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out1762619022|, ~weak$$choice2~0=~weak$$choice2~0_In1762619022, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out1762619022|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1762619022} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 02:04:57,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L766-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_51 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~y~0=v_~y~0_51, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 02:04:57,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1753219574 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1753219574 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1753219574 |P2Thread1of1ForFork3_#t~ite28_Out1753219574|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out1753219574|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1753219574, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1753219574} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1753219574, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1753219574, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out1753219574|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-27 02:04:57,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L797-->L797-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1165329021 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1165329021 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1165329021 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1165329021 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out-1165329021| ~y$w_buff1_used~0_In-1165329021)) (and (= |P2Thread1of1ForFork3_#t~ite29_Out-1165329021| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1165329021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1165329021, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1165329021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1165329021} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1165329021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1165329021, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1165329021, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1165329021|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1165329021} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-27 02:04:57,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L798-->L799: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1739072074 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1739072074 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out-1739072074 0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In-1739072074 ~y$r_buff0_thd3~0_Out-1739072074) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1739072074, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1739072074} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-1739072074|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1739072074, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1739072074} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 02:04:57,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In2135111698 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In2135111698 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2135111698 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In2135111698 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out2135111698| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite31_Out2135111698| ~y$r_buff1_thd3~0_In2135111698)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2135111698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2135111698, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2135111698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2135111698} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2135111698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2135111698, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2135111698, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out2135111698|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2135111698} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 02:04:57,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L799-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_128 (+ v_~__unbuffered_cnt~0_129 1)) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_38| v_~y$r_buff1_thd3~0_60)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_60, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 02:04:57,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L853: Formula: (and (= 4 v_~__unbuffered_cnt~0_30) (= v_~main$tmp_guard0~0_10 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:04:57,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L853-2-->L853-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite42_Out2095361101| |ULTIMATE.start_main_#t~ite43_Out2095361101|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2095361101 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2095361101 256)))) (or (and (= ~y~0_In2095361101 |ULTIMATE.start_main_#t~ite42_Out2095361101|) .cse0 (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out2095361101| ~y$w_buff1~0_In2095361101)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2095361101, ~y~0=~y~0_In2095361101, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2095361101, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2095361101} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2095361101, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2095361101|, ~y~0=~y~0_In2095361101, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2095361101|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2095361101, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2095361101} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:04:57,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L854-->L854-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-84258984 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-84258984 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-84258984| ~y$w_buff0_used~0_In-84258984) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-84258984| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-84258984, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-84258984} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-84258984, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-84258984, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-84258984|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 02:04:57,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In15692218 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In15692218 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In15692218 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In15692218 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In15692218 |ULTIMATE.start_main_#t~ite45_Out15692218|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite45_Out15692218|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In15692218, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In15692218, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In15692218, ~y$w_buff1_used~0=~y$w_buff1_used~0_In15692218} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In15692218, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In15692218, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In15692218, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out15692218|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In15692218} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 02:04:57,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1699504903 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1699504903 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite46_Out-1699504903|)) (and (= ~y$r_buff0_thd0~0_In-1699504903 |ULTIMATE.start_main_#t~ite46_Out-1699504903|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1699504903, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1699504903} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1699504903, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1699504903, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1699504903|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 02:04:57,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L857-->L857-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In2020110681 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In2020110681 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2020110681 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In2020110681 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite47_Out2020110681| 0)) (and (= |ULTIMATE.start_main_#t~ite47_Out2020110681| ~y$r_buff1_thd0~0_In2020110681) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2020110681, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2020110681, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2020110681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2020110681} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2020110681, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2020110681, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2020110681|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2020110681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2020110681} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 02:04:57,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p3_EAX~0_22) (= 0 v_~__unbuffered_p1_EAX~0_23) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_40|) (= v_~x~0_41 2) (= v_~main$tmp_guard1~0_23 0) (= v_~z~0_83 2) (= 0 v_~__unbuffered_p3_EBX~0_22)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:04:57,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:04:57 BasicIcfg [2019-12-27 02:04:57,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:04:57,388 INFO L168 Benchmark]: Toolchain (without parser) took 172854.83 ms. Allocated memory was 137.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 98.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 02:04:57,388 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 02:04:57,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.53 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 98.6 MB in the beginning and 154.8 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:04:57,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.40 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:04:57,390 INFO L168 Benchmark]: Boogie Preprocessor took 39.88 ms. Allocated memory is still 201.3 MB. Free memory was 152.1 MB in the beginning and 149.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:04:57,390 INFO L168 Benchmark]: RCFGBuilder took 814.47 ms. Allocated memory is still 201.3 MB. Free memory was 149.4 MB in the beginning and 100.2 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:04:57,391 INFO L168 Benchmark]: TraceAbstraction took 171166.29 ms. Allocated memory was 201.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.2 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 02:04:57,393 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.51 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.53 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 98.6 MB in the beginning and 154.8 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.40 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.88 ms. Allocated memory is still 201.3 MB. Free memory was 152.1 MB in the beginning and 149.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 814.47 ms. Allocated memory is still 201.3 MB. Free memory was 149.4 MB in the beginning and 100.2 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 171166.29 ms. Allocated memory was 201.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.2 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 180 ProgramPointsBefore, 90 ProgramPointsAfterwards, 208 TransitionsBefore, 97 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 274 VarBasedMoverChecksNegative, 123 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 74757 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] FCALL, FORK 0 pthread_create(&t718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t719, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L847] FCALL, FORK 0 pthread_create(&t720, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 4 z = 2 [L812] 4 __unbuffered_p3_EAX = z [L815] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L751] 2 x = 2 [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L853] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 170.7s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 53.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6666 SDtfs, 7860 SDslu, 20500 SDs, 0 SdLazy, 16049 SolverSat, 496 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 423 GetRequests, 83 SyntacticMatches, 31 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1504 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235278occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 66.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 269700 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1417 NumberOfCodeBlocks, 1417 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1328 ConstructedInterpolants, 0 QuantifiedInterpolants, 307015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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 proved your program to be incorrect! Received shutdown request...