/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:59:11,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:59:11,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:59:11,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:59:11,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:59:11,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:59:11,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:59:11,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:59:11,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:59:11,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:59:11,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:59:11,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:59:11,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:59:11,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:59:11,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:59:11,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:59:11,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:59:11,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:59:11,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:59:11,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:59:11,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:59:11,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:59:11,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:59:11,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:59:11,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:59:11,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:59:11,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:59:11,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:59:11,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:59:11,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:59:11,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:59:11,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:59:11,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:59:11,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:59:11,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:59:11,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:59:11,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:59:11,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:59:11,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:59:11,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:59:11,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:59:11,301 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-VariableLbe-MCR.epf [2019-12-27 19:59:11,323 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:59:11,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:59:11,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:59:11,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:59:11,326 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:59:11,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:59:11,326 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:59:11,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:59:11,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:59:11,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:59:11,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:59:11,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:59:11,329 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:59:11,329 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:59:11,329 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:59:11,329 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:59:11,330 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:59:11,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:59:11,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:59:11,330 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:59:11,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:59:11,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:59:11,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:59:11,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:59:11,332 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:59:11,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:59:11,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:59:11,332 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:59:11,332 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:59:11,333 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:59:11,333 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:59:11,334 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:59:11,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:59:11,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:59:11,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:59:11,650 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:59:11,651 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:59:11,652 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_rmo.oepc.i [2019-12-27 19:59:11,714 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207be938b/1ae553dc6dab4d578077999b8491446a/FLAG4c884a2ff [2019-12-27 19:59:12,260 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:59:12,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_rmo.oepc.i [2019-12-27 19:59:12,289 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207be938b/1ae553dc6dab4d578077999b8491446a/FLAG4c884a2ff [2019-12-27 19:59:12,564 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207be938b/1ae553dc6dab4d578077999b8491446a [2019-12-27 19:59:12,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:59:12,578 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:59:12,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:59:12,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:59:12,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:59:12,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:59:12" (1/1) ... [2019-12-27 19:59:12,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:12, skipping insertion in model container [2019-12-27 19:59:12,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:59:12" (1/1) ... [2019-12-27 19:59:12,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:59:12,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:59:13,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:59:13,216 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:59:13,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:59:13,361 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:59:13,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:13 WrapperNode [2019-12-27 19:59:13,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:59:13,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:59:13,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:59:13,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:59:13,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:13" (1/1) ... [2019-12-27 19:59:13,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:13" (1/1) ... [2019-12-27 19:59:13,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:59:13,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:59:13,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:59:13,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:59:13,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:13" (1/1) ... [2019-12-27 19:59:13,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:13" (1/1) ... [2019-12-27 19:59:13,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:13" (1/1) ... [2019-12-27 19:59:13,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:13" (1/1) ... [2019-12-27 19:59:13,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:13" (1/1) ... [2019-12-27 19:59:13,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:13" (1/1) ... [2019-12-27 19:59:13,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:13" (1/1) ... [2019-12-27 19:59:13,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:59:13,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:59:13,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:59:13,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:59:13,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:13" (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 19:59:13,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:59:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:59:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:59:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:59:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 19:59:13,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 19:59:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 19:59:13,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 19:59:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 19:59:13,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 19:59:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:59:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:59:13,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:59:13,536 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 19:59:14,308 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:59:14,309 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 19:59:14,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:59:14 BoogieIcfgContainer [2019-12-27 19:59:14,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:59:14,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:59:14,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:59:14,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:59:14,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:59:12" (1/3) ... [2019-12-27 19:59:14,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ced0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:59:14, skipping insertion in model container [2019-12-27 19:59:14,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:13" (2/3) ... [2019-12-27 19:59:14,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ced0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:59:14, skipping insertion in model container [2019-12-27 19:59:14,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:59:14" (3/3) ... [2019-12-27 19:59:14,320 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_rmo.oepc.i [2019-12-27 19:59:14,330 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:59:14,331 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:59:14,338 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:59:14,339 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:59:14,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,387 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,387 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,387 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,388 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,388 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,402 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,402 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,437 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,438 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,487 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,491 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,506 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,506 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,506 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,512 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,513 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:59:14,533 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:59:14,553 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:59:14,554 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:59:14,554 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:59:14,554 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:59:14,554 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:59:14,554 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:59:14,554 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:59:14,554 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:59:14,569 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 19:59:14,571 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 19:59:14,701 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 19:59:14,701 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:59:14,722 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:59:14,744 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 19:59:14,835 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 19:59:14,835 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:59:14,843 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:59:14,864 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 19:59:14,866 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:59:18,094 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 19:59:18,492 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 19:59:18,660 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 19:59:18,706 INFO L206 etLargeBlockEncoding]: Checked pairs total: 95714 [2019-12-27 19:59:18,707 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 19:59:18,711 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 108 transitions [2019-12-27 19:59:44,759 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 138242 states. [2019-12-27 19:59:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 138242 states. [2019-12-27 19:59:44,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:59:44,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:44,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:59:44,769 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:59:44,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:44,775 INFO L82 PathProgramCache]: Analyzing trace with hash 917980, now seen corresponding path program 1 times [2019-12-27 19:59:44,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:44,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327246726] [2019-12-27 19:59:44,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:45,038 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 19:59:45,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327246726] [2019-12-27 19:59:45,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:45,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:59:45,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1439683057] [2019-12-27 19:59:45,042 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:45,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:45,060 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:59:45,060 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:45,064 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:59:45,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:59:45,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:45,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:59:45,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:59:45,083 INFO L87 Difference]: Start difference. First operand 138242 states. Second operand 3 states. [2019-12-27 19:59:46,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:46,712 INFO L93 Difference]: Finished difference Result 137016 states and 586554 transitions. [2019-12-27 19:59:46,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:59:46,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:59:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:51,221 INFO L225 Difference]: With dead ends: 137016 [2019-12-27 19:59:51,221 INFO L226 Difference]: Without dead ends: 128980 [2019-12-27 19:59:51,222 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 19:59:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128980 states. [2019-12-27 19:59:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128980 to 128980. [2019-12-27 19:59:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128980 states. [2019-12-27 20:00:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128980 states to 128980 states and 551484 transitions. [2019-12-27 20:00:00,760 INFO L78 Accepts]: Start accepts. Automaton has 128980 states and 551484 transitions. Word has length 3 [2019-12-27 20:00:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:00,760 INFO L462 AbstractCegarLoop]: Abstraction has 128980 states and 551484 transitions. [2019-12-27 20:00:00,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:00:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 128980 states and 551484 transitions. [2019-12-27 20:00:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:00:00,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:00,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:00,766 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:00,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:00,767 INFO L82 PathProgramCache]: Analyzing trace with hash 178231614, now seen corresponding path program 1 times [2019-12-27 20:00:00,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:00,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651184602] [2019-12-27 20:00:00,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:00,907 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 20:00:00,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651184602] [2019-12-27 20:00:00,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:00,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:00:00,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2144364343] [2019-12-27 20:00:00,910 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:00,911 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:00,913 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:00:00,914 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:00,914 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:00:00,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:00:00,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:00,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:00:00,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:00:00,916 INFO L87 Difference]: Start difference. First operand 128980 states and 551484 transitions. Second operand 4 states. [2019-12-27 20:00:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:06,886 INFO L93 Difference]: Finished difference Result 200378 states and 822381 transitions. [2019-12-27 20:00:06,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:00:06,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:00:06,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:07,556 INFO L225 Difference]: With dead ends: 200378 [2019-12-27 20:00:07,557 INFO L226 Difference]: Without dead ends: 200329 [2019-12-27 20:00:07,558 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 20:00:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200329 states. [2019-12-27 20:00:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200329 to 184385. [2019-12-27 20:00:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184385 states. [2019-12-27 20:00:24,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184385 states to 184385 states and 766782 transitions. [2019-12-27 20:00:24,297 INFO L78 Accepts]: Start accepts. Automaton has 184385 states and 766782 transitions. Word has length 11 [2019-12-27 20:00:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:24,299 INFO L462 AbstractCegarLoop]: Abstraction has 184385 states and 766782 transitions. [2019-12-27 20:00:24,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:00:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 184385 states and 766782 transitions. [2019-12-27 20:00:24,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:00:24,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:24,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:24,306 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:24,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:24,307 INFO L82 PathProgramCache]: Analyzing trace with hash -786514357, now seen corresponding path program 1 times [2019-12-27 20:00:24,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:24,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529919842] [2019-12-27 20:00:24,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:24,363 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 20:00:24,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529919842] [2019-12-27 20:00:24,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:24,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:00:24,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1196757528] [2019-12-27 20:00:24,364 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:24,366 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:24,367 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:00:24,367 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:24,368 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:00:24,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:00:24,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:24,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:00:24,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:00:24,369 INFO L87 Difference]: Start difference. First operand 184385 states and 766782 transitions. Second operand 3 states. [2019-12-27 20:00:24,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:24,534 INFO L93 Difference]: Finished difference Result 38211 states and 124394 transitions. [2019-12-27 20:00:24,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:00:24,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:00:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:24,645 INFO L225 Difference]: With dead ends: 38211 [2019-12-27 20:00:24,645 INFO L226 Difference]: Without dead ends: 38211 [2019-12-27 20:00:24,646 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 20:00:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38211 states. [2019-12-27 20:00:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38211 to 38211. [2019-12-27 20:00:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38211 states. [2019-12-27 20:00:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38211 states to 38211 states and 124394 transitions. [2019-12-27 20:00:25,416 INFO L78 Accepts]: Start accepts. Automaton has 38211 states and 124394 transitions. Word has length 13 [2019-12-27 20:00:25,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:25,416 INFO L462 AbstractCegarLoop]: Abstraction has 38211 states and 124394 transitions. [2019-12-27 20:00:25,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:00:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 38211 states and 124394 transitions. [2019-12-27 20:00:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:00:25,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:25,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:25,420 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:25,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1326052248, now seen corresponding path program 1 times [2019-12-27 20:00:25,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:25,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361652411] [2019-12-27 20:00:25,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:25,524 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 20:00:25,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361652411] [2019-12-27 20:00:25,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:25,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:00:25,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [470378770] [2019-12-27 20:00:25,525 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:25,528 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:25,530 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:00:25,531 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:25,531 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:00:25,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:00:25,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:25,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:00:25,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:00:25,532 INFO L87 Difference]: Start difference. First operand 38211 states and 124394 transitions. Second operand 5 states. [2019-12-27 20:00:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:28,846 INFO L93 Difference]: Finished difference Result 52954 states and 170202 transitions. [2019-12-27 20:00:28,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:00:28,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 20:00:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:28,962 INFO L225 Difference]: With dead ends: 52954 [2019-12-27 20:00:28,962 INFO L226 Difference]: Without dead ends: 52954 [2019-12-27 20:00:28,963 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 20:00:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52954 states. [2019-12-27 20:00:29,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52954 to 45311. [2019-12-27 20:00:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45311 states. [2019-12-27 20:00:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45311 states to 45311 states and 146879 transitions. [2019-12-27 20:00:29,873 INFO L78 Accepts]: Start accepts. Automaton has 45311 states and 146879 transitions. Word has length 16 [2019-12-27 20:00:29,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:29,874 INFO L462 AbstractCegarLoop]: Abstraction has 45311 states and 146879 transitions. [2019-12-27 20:00:29,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:00:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 45311 states and 146879 transitions. [2019-12-27 20:00:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:00:29,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:29,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:29,887 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:29,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:29,887 INFO L82 PathProgramCache]: Analyzing trace with hash 572858118, now seen corresponding path program 1 times [2019-12-27 20:00:29,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:29,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033471133] [2019-12-27 20:00:29,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:30,005 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 20:00:30,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033471133] [2019-12-27 20:00:30,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:30,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:00:30,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [248751561] [2019-12-27 20:00:30,006 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:30,010 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:30,019 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 58 transitions. [2019-12-27 20:00:30,019 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:30,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:00:30,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:00:30,114 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:00:30,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:00:30,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:30,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:00:30,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:00:30,115 INFO L87 Difference]: Start difference. First operand 45311 states and 146879 transitions. Second operand 9 states. [2019-12-27 20:00:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:31,456 INFO L93 Difference]: Finished difference Result 72804 states and 228787 transitions. [2019-12-27 20:00:31,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 20:00:31,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 20:00:31,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:31,608 INFO L225 Difference]: With dead ends: 72804 [2019-12-27 20:00:31,608 INFO L226 Difference]: Without dead ends: 72790 [2019-12-27 20:00:31,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:00:31,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72790 states. [2019-12-27 20:00:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72790 to 44975. [2019-12-27 20:00:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44975 states. [2019-12-27 20:00:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44975 states to 44975 states and 144930 transitions. [2019-12-27 20:00:32,990 INFO L78 Accepts]: Start accepts. Automaton has 44975 states and 144930 transitions. Word has length 22 [2019-12-27 20:00:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:32,990 INFO L462 AbstractCegarLoop]: Abstraction has 44975 states and 144930 transitions. [2019-12-27 20:00:32,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:00:32,990 INFO L276 IsEmpty]: Start isEmpty. Operand 44975 states and 144930 transitions. [2019-12-27 20:00:33,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:00:33,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:33,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:33,009 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:33,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:33,009 INFO L82 PathProgramCache]: Analyzing trace with hash -775936505, now seen corresponding path program 1 times [2019-12-27 20:00:33,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:33,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988664415] [2019-12-27 20:00:33,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:33,072 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 20:00:33,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988664415] [2019-12-27 20:00:33,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:33,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:00:33,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1907214305] [2019-12-27 20:00:33,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:33,076 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:33,086 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 20:00:33,086 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:33,109 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:00:33,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:00:33,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:33,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:00:33,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:00:33,110 INFO L87 Difference]: Start difference. First operand 44975 states and 144930 transitions. Second operand 5 states. [2019-12-27 20:00:33,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:33,211 INFO L93 Difference]: Finished difference Result 18102 states and 54995 transitions. [2019-12-27 20:00:33,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:00:33,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:00:33,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:33,240 INFO L225 Difference]: With dead ends: 18102 [2019-12-27 20:00:33,240 INFO L226 Difference]: Without dead ends: 18102 [2019-12-27 20:00:33,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:00:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18102 states. [2019-12-27 20:00:33,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18102 to 17802. [2019-12-27 20:00:33,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17802 states. [2019-12-27 20:00:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17802 states to 17802 states and 54181 transitions. [2019-12-27 20:00:33,522 INFO L78 Accepts]: Start accepts. Automaton has 17802 states and 54181 transitions. Word has length 25 [2019-12-27 20:00:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:33,522 INFO L462 AbstractCegarLoop]: Abstraction has 17802 states and 54181 transitions. [2019-12-27 20:00:33,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:00:33,523 INFO L276 IsEmpty]: Start isEmpty. Operand 17802 states and 54181 transitions. [2019-12-27 20:00:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:00:33,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:33,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:33,536 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:33,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1393972684, now seen corresponding path program 1 times [2019-12-27 20:00:33,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:33,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82088223] [2019-12-27 20:00:33,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:33,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 20:00:33,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82088223] [2019-12-27 20:00:33,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:33,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:00:33,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1774073320] [2019-12-27 20:00:33,641 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:33,645 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:33,651 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:00:33,651 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:33,652 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:00:33,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:00:33,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:33,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:00:33,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:00:33,653 INFO L87 Difference]: Start difference. First operand 17802 states and 54181 transitions. Second operand 6 states. [2019-12-27 20:00:34,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:34,232 INFO L93 Difference]: Finished difference Result 25666 states and 75651 transitions. [2019-12-27 20:00:34,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:00:34,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 20:00:34,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:34,270 INFO L225 Difference]: With dead ends: 25666 [2019-12-27 20:00:34,270 INFO L226 Difference]: Without dead ends: 25666 [2019-12-27 20:00:34,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:00:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25666 states. [2019-12-27 20:00:34,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25666 to 20719. [2019-12-27 20:00:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20719 states. [2019-12-27 20:00:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20719 states to 20719 states and 62283 transitions. [2019-12-27 20:00:34,762 INFO L78 Accepts]: Start accepts. Automaton has 20719 states and 62283 transitions. Word has length 27 [2019-12-27 20:00:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:34,762 INFO L462 AbstractCegarLoop]: Abstraction has 20719 states and 62283 transitions. [2019-12-27 20:00:34,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:00:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 20719 states and 62283 transitions. [2019-12-27 20:00:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:00:34,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:34,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:34,784 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:34,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:34,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1695040076, now seen corresponding path program 1 times [2019-12-27 20:00:34,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:34,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769118094] [2019-12-27 20:00:34,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:34,862 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 20:00:34,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769118094] [2019-12-27 20:00:34,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:34,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:00:34,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [636066061] [2019-12-27 20:00:34,864 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:34,869 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:34,885 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 74 transitions. [2019-12-27 20:00:34,885 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:34,923 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:00:34,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:00:34,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:34,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:00:34,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:00:34,925 INFO L87 Difference]: Start difference. First operand 20719 states and 62283 transitions. Second operand 6 states. [2019-12-27 20:00:35,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:35,436 INFO L93 Difference]: Finished difference Result 25941 states and 77027 transitions. [2019-12-27 20:00:35,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:00:35,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 20:00:35,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:35,475 INFO L225 Difference]: With dead ends: 25941 [2019-12-27 20:00:35,476 INFO L226 Difference]: Without dead ends: 25941 [2019-12-27 20:00:35,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:00:35,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25941 states. [2019-12-27 20:00:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25941 to 21961. [2019-12-27 20:00:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21961 states. [2019-12-27 20:00:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21961 states to 21961 states and 66303 transitions. [2019-12-27 20:00:35,839 INFO L78 Accepts]: Start accepts. Automaton has 21961 states and 66303 transitions. Word has length 33 [2019-12-27 20:00:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:35,839 INFO L462 AbstractCegarLoop]: Abstraction has 21961 states and 66303 transitions. [2019-12-27 20:00:35,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:00:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 21961 states and 66303 transitions. [2019-12-27 20:00:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:00:35,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:35,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:35,863 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:35,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:35,863 INFO L82 PathProgramCache]: Analyzing trace with hash 843232464, now seen corresponding path program 2 times [2019-12-27 20:00:35,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:35,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848548106] [2019-12-27 20:00:35,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:36,014 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 20:00:36,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848548106] [2019-12-27 20:00:36,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:36,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:00:36,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [964899068] [2019-12-27 20:00:36,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:36,020 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:36,031 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 73 transitions. [2019-12-27 20:00:36,031 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:36,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:00:36,139 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:00:36,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:00:36,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:36,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:00:36,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:00:36,141 INFO L87 Difference]: Start difference. First operand 21961 states and 66303 transitions. Second operand 11 states. [2019-12-27 20:00:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:38,021 INFO L93 Difference]: Finished difference Result 41081 states and 121295 transitions. [2019-12-27 20:00:38,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 20:00:38,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-12-27 20:00:38,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:38,083 INFO L225 Difference]: With dead ends: 41081 [2019-12-27 20:00:38,083 INFO L226 Difference]: Without dead ends: 41081 [2019-12-27 20:00:38,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 20:00:38,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41081 states. [2019-12-27 20:00:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41081 to 22293. [2019-12-27 20:00:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22293 states. [2019-12-27 20:00:38,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22293 states to 22293 states and 67787 transitions. [2019-12-27 20:00:38,705 INFO L78 Accepts]: Start accepts. Automaton has 22293 states and 67787 transitions. Word has length 33 [2019-12-27 20:00:38,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:38,706 INFO L462 AbstractCegarLoop]: Abstraction has 22293 states and 67787 transitions. [2019-12-27 20:00:38,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:00:38,706 INFO L276 IsEmpty]: Start isEmpty. Operand 22293 states and 67787 transitions. [2019-12-27 20:00:38,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:00:38,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:38,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] [2019-12-27 20:00:38,733 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:38,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:38,734 INFO L82 PathProgramCache]: Analyzing trace with hash 353210315, now seen corresponding path program 1 times [2019-12-27 20:00:38,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:38,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435981807] [2019-12-27 20:00:38,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:38,789 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 20:00:38,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435981807] [2019-12-27 20:00:38,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:38,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:00:38,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1951605749] [2019-12-27 20:00:38,791 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:38,798 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:38,850 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 296 transitions. [2019-12-27 20:00:38,850 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:38,851 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:00:38,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:00:38,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:38,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:00:38,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:00:38,852 INFO L87 Difference]: Start difference. First operand 22293 states and 67787 transitions. Second operand 3 states. [2019-12-27 20:00:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:38,919 INFO L93 Difference]: Finished difference Result 22292 states and 67785 transitions. [2019-12-27 20:00:38,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:00:38,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 20:00:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:38,949 INFO L225 Difference]: With dead ends: 22292 [2019-12-27 20:00:38,949 INFO L226 Difference]: Without dead ends: 22292 [2019-12-27 20:00:38,950 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 20:00:39,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22292 states. [2019-12-27 20:00:39,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22292 to 22292. [2019-12-27 20:00:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22292 states. [2019-12-27 20:00:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22292 states to 22292 states and 67785 transitions. [2019-12-27 20:00:39,265 INFO L78 Accepts]: Start accepts. Automaton has 22292 states and 67785 transitions. Word has length 39 [2019-12-27 20:00:39,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:39,265 INFO L462 AbstractCegarLoop]: Abstraction has 22292 states and 67785 transitions. [2019-12-27 20:00:39,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:00:39,265 INFO L276 IsEmpty]: Start isEmpty. Operand 22292 states and 67785 transitions. [2019-12-27 20:00:39,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:00:39,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:39,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:39,288 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:39,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:39,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1411726100, now seen corresponding path program 1 times [2019-12-27 20:00:39,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:39,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295779319] [2019-12-27 20:00:39,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:39,377 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 20:00:39,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295779319] [2019-12-27 20:00:39,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:39,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:00:39,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [215854175] [2019-12-27 20:00:39,379 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:39,387 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:39,449 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 358 transitions. [2019-12-27 20:00:39,450 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:39,506 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:00:39,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:00:39,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:39,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:00:39,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:00:39,507 INFO L87 Difference]: Start difference. First operand 22292 states and 67785 transitions. Second operand 6 states. [2019-12-27 20:00:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:39,973 INFO L93 Difference]: Finished difference Result 30398 states and 90635 transitions. [2019-12-27 20:00:39,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:00:39,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 20:00:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:40,015 INFO L225 Difference]: With dead ends: 30398 [2019-12-27 20:00:40,015 INFO L226 Difference]: Without dead ends: 30398 [2019-12-27 20:00:40,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:00:40,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30398 states. [2019-12-27 20:00:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30398 to 21118. [2019-12-27 20:00:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21118 states. [2019-12-27 20:00:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21118 states to 21118 states and 63372 transitions. [2019-12-27 20:00:40,542 INFO L78 Accepts]: Start accepts. Automaton has 21118 states and 63372 transitions. Word has length 40 [2019-12-27 20:00:40,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:40,542 INFO L462 AbstractCegarLoop]: Abstraction has 21118 states and 63372 transitions. [2019-12-27 20:00:40,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:00:40,542 INFO L276 IsEmpty]: Start isEmpty. Operand 21118 states and 63372 transitions. [2019-12-27 20:00:40,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:00:40,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:40,568 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] [2019-12-27 20:00:40,568 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:40,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:40,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1239521661, now seen corresponding path program 1 times [2019-12-27 20:00:40,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:40,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79991253] [2019-12-27 20:00:40,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:40,657 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 20:00:40,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79991253] [2019-12-27 20:00:40,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:40,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:00:40,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006517070] [2019-12-27 20:00:40,658 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:40,667 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:40,745 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 171 states and 335 transitions. [2019-12-27 20:00:40,745 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:40,748 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:00:40,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:00:40,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:40,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:00:40,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:00:40,750 INFO L87 Difference]: Start difference. First operand 21118 states and 63372 transitions. Second operand 3 states. [2019-12-27 20:00:40,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:40,856 INFO L93 Difference]: Finished difference Result 21019 states and 63072 transitions. [2019-12-27 20:00:40,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:00:40,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 20:00:40,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:40,886 INFO L225 Difference]: With dead ends: 21019 [2019-12-27 20:00:40,886 INFO L226 Difference]: Without dead ends: 21019 [2019-12-27 20:00:40,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:00:40,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21019 states. [2019-12-27 20:00:41,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21019 to 18898. [2019-12-27 20:00:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18898 states. [2019-12-27 20:00:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18898 states to 18898 states and 57376 transitions. [2019-12-27 20:00:41,210 INFO L78 Accepts]: Start accepts. Automaton has 18898 states and 57376 transitions. Word has length 41 [2019-12-27 20:00:41,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:41,210 INFO L462 AbstractCegarLoop]: Abstraction has 18898 states and 57376 transitions. [2019-12-27 20:00:41,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:00:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 18898 states and 57376 transitions. [2019-12-27 20:00:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:00:41,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:41,238 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 20:00:41,239 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:41,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:41,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1783448567, now seen corresponding path program 1 times [2019-12-27 20:00:41,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:41,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591275362] [2019-12-27 20:00:41,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:41,302 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 20:00:41,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591275362] [2019-12-27 20:00:41,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:41,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:00:41,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1991316577] [2019-12-27 20:00:41,304 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:41,315 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:41,391 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 173 states and 338 transitions. [2019-12-27 20:00:41,391 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:41,434 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:00:41,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:00:41,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:41,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:00:41,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:00:41,435 INFO L87 Difference]: Start difference. First operand 18898 states and 57376 transitions. Second operand 7 states. [2019-12-27 20:00:41,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:41,566 INFO L93 Difference]: Finished difference Result 17577 states and 54406 transitions. [2019-12-27 20:00:41,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:00:41,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 20:00:41,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:41,603 INFO L225 Difference]: With dead ends: 17577 [2019-12-27 20:00:41,603 INFO L226 Difference]: Without dead ends: 16436 [2019-12-27 20:00:41,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:00:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16436 states. [2019-12-27 20:00:41,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16436 to 16292. [2019-12-27 20:00:41,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16292 states. [2019-12-27 20:00:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16292 states to 16292 states and 51024 transitions. [2019-12-27 20:00:41,965 INFO L78 Accepts]: Start accepts. Automaton has 16292 states and 51024 transitions. Word has length 42 [2019-12-27 20:00:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:41,965 INFO L462 AbstractCegarLoop]: Abstraction has 16292 states and 51024 transitions. [2019-12-27 20:00:41,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:00:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 16292 states and 51024 transitions. [2019-12-27 20:00:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:00:41,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:41,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:41,982 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:41,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:41,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1446147833, now seen corresponding path program 1 times [2019-12-27 20:00:41,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:41,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767407278] [2019-12-27 20:00:41,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:42,040 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 20:00:42,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767407278] [2019-12-27 20:00:42,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:42,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:00:42,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [447078058] [2019-12-27 20:00:42,042 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:42,065 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:42,468 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 221 states and 409 transitions. [2019-12-27 20:00:42,469 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:42,494 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:00:42,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:00:42,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:42,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:00:42,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:00:42,496 INFO L87 Difference]: Start difference. First operand 16292 states and 51024 transitions. Second operand 3 states. [2019-12-27 20:00:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:42,644 INFO L93 Difference]: Finished difference Result 19868 states and 61774 transitions. [2019-12-27 20:00:42,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:00:42,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 20:00:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:42,687 INFO L225 Difference]: With dead ends: 19868 [2019-12-27 20:00:42,688 INFO L226 Difference]: Without dead ends: 19868 [2019-12-27 20:00:42,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 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 20:00:42,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19868 states. [2019-12-27 20:00:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19868 to 14853. [2019-12-27 20:00:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14853 states. [2019-12-27 20:00:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14853 states to 14853 states and 46400 transitions. [2019-12-27 20:00:43,099 INFO L78 Accepts]: Start accepts. Automaton has 14853 states and 46400 transitions. Word has length 66 [2019-12-27 20:00:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:43,099 INFO L462 AbstractCegarLoop]: Abstraction has 14853 states and 46400 transitions. [2019-12-27 20:00:43,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:00:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 14853 states and 46400 transitions. [2019-12-27 20:00:43,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:00:43,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:43,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:43,121 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:43,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:43,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1778049442, now seen corresponding path program 1 times [2019-12-27 20:00:43,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:43,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121574935] [2019-12-27 20:00:43,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:43,268 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 20:00:43,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121574935] [2019-12-27 20:00:43,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:43,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:00:43,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1124667264] [2019-12-27 20:00:43,270 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:43,313 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:43,480 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 392 transitions. [2019-12-27 20:00:43,480 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:43,646 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 20:00:43,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:00:43,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:43,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:00:43,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:00:43,647 INFO L87 Difference]: Start difference. First operand 14853 states and 46400 transitions. Second operand 11 states. [2019-12-27 20:00:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:45,622 INFO L93 Difference]: Finished difference Result 37514 states and 117559 transitions. [2019-12-27 20:00:45,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 20:00:45,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 20:00:45,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:45,661 INFO L225 Difference]: With dead ends: 37514 [2019-12-27 20:00:45,661 INFO L226 Difference]: Without dead ends: 26700 [2019-12-27 20:00:45,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2019-12-27 20:00:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26700 states. [2019-12-27 20:00:46,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26700 to 18392. [2019-12-27 20:00:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18392 states. [2019-12-27 20:00:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18392 states to 18392 states and 57335 transitions. [2019-12-27 20:00:46,136 INFO L78 Accepts]: Start accepts. Automaton has 18392 states and 57335 transitions. Word has length 66 [2019-12-27 20:00:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:46,137 INFO L462 AbstractCegarLoop]: Abstraction has 18392 states and 57335 transitions. [2019-12-27 20:00:46,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:00:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 18392 states and 57335 transitions. [2019-12-27 20:00:46,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:00:46,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:46,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:46,155 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:46,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:46,156 INFO L82 PathProgramCache]: Analyzing trace with hash -415442966, now seen corresponding path program 2 times [2019-12-27 20:00:46,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:46,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746241135] [2019-12-27 20:00:46,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:46,223 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 20:00:46,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746241135] [2019-12-27 20:00:46,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:46,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:00:46,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2074393066] [2019-12-27 20:00:46,225 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:46,245 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:46,480 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 487 transitions. [2019-12-27 20:00:46,480 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:46,482 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:00:46,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:00:46,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:46,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:00:46,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:00:46,483 INFO L87 Difference]: Start difference. First operand 18392 states and 57335 transitions. Second operand 3 states. [2019-12-27 20:00:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:46,593 INFO L93 Difference]: Finished difference Result 21781 states and 67544 transitions. [2019-12-27 20:00:46,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:00:46,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 20:00:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:46,623 INFO L225 Difference]: With dead ends: 21781 [2019-12-27 20:00:46,623 INFO L226 Difference]: Without dead ends: 21781 [2019-12-27 20:00:46,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 20:00:46,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21781 states. [2019-12-27 20:00:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21781 to 18926. [2019-12-27 20:00:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18926 states. [2019-12-27 20:00:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18926 states to 18926 states and 59112 transitions. [2019-12-27 20:00:46,944 INFO L78 Accepts]: Start accepts. Automaton has 18926 states and 59112 transitions. Word has length 66 [2019-12-27 20:00:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:46,944 INFO L462 AbstractCegarLoop]: Abstraction has 18926 states and 59112 transitions. [2019-12-27 20:00:46,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:00:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 18926 states and 59112 transitions. [2019-12-27 20:00:46,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:00:46,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:46,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:46,963 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:46,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:46,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1124059975, now seen corresponding path program 1 times [2019-12-27 20:00:46,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:46,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107656187] [2019-12-27 20:00:46,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:00:47,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107656187] [2019-12-27 20:00:47,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:47,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:00:47,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1511525605] [2019-12-27 20:00:47,008 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:47,029 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:47,400 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 253 states and 490 transitions. [2019-12-27 20:00:47,400 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:47,402 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:00:47,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:00:47,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:47,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:00:47,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:00:47,403 INFO L87 Difference]: Start difference. First operand 18926 states and 59112 transitions. Second operand 3 states. [2019-12-27 20:00:47,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:47,598 INFO L93 Difference]: Finished difference Result 27366 states and 85370 transitions. [2019-12-27 20:00:47,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:00:47,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 20:00:47,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:47,638 INFO L225 Difference]: With dead ends: 27366 [2019-12-27 20:00:47,638 INFO L226 Difference]: Without dead ends: 27366 [2019-12-27 20:00:47,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 20:00:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27366 states. [2019-12-27 20:00:47,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27366 to 19344. [2019-12-27 20:00:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19344 states. [2019-12-27 20:00:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19344 states to 19344 states and 60427 transitions. [2019-12-27 20:00:47,999 INFO L78 Accepts]: Start accepts. Automaton has 19344 states and 60427 transitions. Word has length 67 [2019-12-27 20:00:47,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:47,999 INFO L462 AbstractCegarLoop]: Abstraction has 19344 states and 60427 transitions. [2019-12-27 20:00:47,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:00:47,999 INFO L276 IsEmpty]: Start isEmpty. Operand 19344 states and 60427 transitions. [2019-12-27 20:00:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:00:48,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:48,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:48,019 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:48,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:48,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1111850191, now seen corresponding path program 2 times [2019-12-27 20:00:48,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:48,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466759829] [2019-12-27 20:00:48,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:48,086 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 20:00:48,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466759829] [2019-12-27 20:00:48,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:48,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:00:48,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [409988445] [2019-12-27 20:00:48,087 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:48,112 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:48,420 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 253 states and 492 transitions. [2019-12-27 20:00:48,420 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:48,422 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:00:48,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:00:48,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:48,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:00:48,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:00:48,423 INFO L87 Difference]: Start difference. First operand 19344 states and 60427 transitions. Second operand 4 states. [2019-12-27 20:00:48,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:48,579 INFO L93 Difference]: Finished difference Result 19344 states and 60245 transitions. [2019-12-27 20:00:48,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:00:48,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 20:00:48,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:48,626 INFO L225 Difference]: With dead ends: 19344 [2019-12-27 20:00:48,626 INFO L226 Difference]: Without dead ends: 19344 [2019-12-27 20:00:48,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:00:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19344 states. [2019-12-27 20:00:49,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19344 to 17362. [2019-12-27 20:00:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17362 states. [2019-12-27 20:00:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17362 states to 17362 states and 54134 transitions. [2019-12-27 20:00:49,120 INFO L78 Accepts]: Start accepts. Automaton has 17362 states and 54134 transitions. Word has length 67 [2019-12-27 20:00:49,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:49,120 INFO L462 AbstractCegarLoop]: Abstraction has 17362 states and 54134 transitions. [2019-12-27 20:00:49,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:00:49,120 INFO L276 IsEmpty]: Start isEmpty. Operand 17362 states and 54134 transitions. [2019-12-27 20:00:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:00:49,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:49,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:49,139 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:49,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:49,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1228876713, now seen corresponding path program 1 times [2019-12-27 20:00:49,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:49,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132245677] [2019-12-27 20:00:49,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:49,373 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 20:00:49,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132245677] [2019-12-27 20:00:49,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:49,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:00:49,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [920396972] [2019-12-27 20:00:49,374 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:49,394 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:49,624 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 253 states and 490 transitions. [2019-12-27 20:00:49,625 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:49,661 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:00:49,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:00:49,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:49,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:00:49,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:00:49,663 INFO L87 Difference]: Start difference. First operand 17362 states and 54134 transitions. Second operand 11 states. [2019-12-27 20:00:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:51,346 INFO L93 Difference]: Finished difference Result 25242 states and 78356 transitions. [2019-12-27 20:00:51,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 20:00:51,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 20:00:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:51,379 INFO L225 Difference]: With dead ends: 25242 [2019-12-27 20:00:51,380 INFO L226 Difference]: Without dead ends: 22583 [2019-12-27 20:00:51,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:00:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22583 states. [2019-12-27 20:00:51,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22583 to 18149. [2019-12-27 20:00:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18149 states. [2019-12-27 20:00:51,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18149 states to 18149 states and 56429 transitions. [2019-12-27 20:00:51,695 INFO L78 Accepts]: Start accepts. Automaton has 18149 states and 56429 transitions. Word has length 67 [2019-12-27 20:00:51,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:51,695 INFO L462 AbstractCegarLoop]: Abstraction has 18149 states and 56429 transitions. [2019-12-27 20:00:51,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:00:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand 18149 states and 56429 transitions. [2019-12-27 20:00:51,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:00:51,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:51,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:51,715 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:51,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:51,715 INFO L82 PathProgramCache]: Analyzing trace with hash -352269481, now seen corresponding path program 2 times [2019-12-27 20:00:51,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:51,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168014409] [2019-12-27 20:00:51,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:52,074 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 20:00:52,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168014409] [2019-12-27 20:00:52,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:52,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 20:00:52,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [932793677] [2019-12-27 20:00:52,075 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:52,097 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:52,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 255 states and 496 transitions. [2019-12-27 20:00:52,504 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:52,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:00:52,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 20:00:52,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 20:00:52,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:52,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 20:00:52,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:00:52,714 INFO L87 Difference]: Start difference. First operand 18149 states and 56429 transitions. Second operand 16 states. [2019-12-27 20:00:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:55,592 INFO L93 Difference]: Finished difference Result 30762 states and 94714 transitions. [2019-12-27 20:00:55,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 20:00:55,592 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 20:00:55,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:55,636 INFO L225 Difference]: With dead ends: 30762 [2019-12-27 20:00:55,637 INFO L226 Difference]: Without dead ends: 29415 [2019-12-27 20:00:55,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=281, Invalid=1279, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 20:00:55,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29415 states. [2019-12-27 20:00:55,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29415 to 17957. [2019-12-27 20:00:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17957 states. [2019-12-27 20:00:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17957 states to 17957 states and 55897 transitions. [2019-12-27 20:00:56,035 INFO L78 Accepts]: Start accepts. Automaton has 17957 states and 55897 transitions. Word has length 67 [2019-12-27 20:00:56,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:56,035 INFO L462 AbstractCegarLoop]: Abstraction has 17957 states and 55897 transitions. [2019-12-27 20:00:56,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 20:00:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 17957 states and 55897 transitions. [2019-12-27 20:00:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:00:56,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:56,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:56,057 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:56,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:56,057 INFO L82 PathProgramCache]: Analyzing trace with hash -163030355, now seen corresponding path program 3 times [2019-12-27 20:00:56,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:56,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833750812] [2019-12-27 20:00:56,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:56,303 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 20:00:56,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833750812] [2019-12-27 20:00:56,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:56,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:00:56,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [105536051] [2019-12-27 20:00:56,304 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:56,332 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:56,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 259 states and 513 transitions. [2019-12-27 20:00:56,681 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:56,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:00:56,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:00:56,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 20:00:56,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:00:56,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:56,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:00:56,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:00:56,885 INFO L87 Difference]: Start difference. First operand 17957 states and 55897 transitions. Second operand 14 states. [2019-12-27 20:00:59,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:59,286 INFO L93 Difference]: Finished difference Result 24165 states and 74988 transitions. [2019-12-27 20:00:59,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 20:00:59,287 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-27 20:00:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:59,323 INFO L225 Difference]: With dead ends: 24165 [2019-12-27 20:00:59,323 INFO L226 Difference]: Without dead ends: 22322 [2019-12-27 20:00:59,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-12-27 20:00:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22322 states. [2019-12-27 20:00:59,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22322 to 18233. [2019-12-27 20:00:59,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18233 states. [2019-12-27 20:00:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18233 states to 18233 states and 56683 transitions. [2019-12-27 20:00:59,654 INFO L78 Accepts]: Start accepts. Automaton has 18233 states and 56683 transitions. Word has length 67 [2019-12-27 20:00:59,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:59,654 INFO L462 AbstractCegarLoop]: Abstraction has 18233 states and 56683 transitions. [2019-12-27 20:00:59,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:00:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 18233 states and 56683 transitions. [2019-12-27 20:00:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:00:59,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:59,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:59,676 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:59,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:59,676 INFO L82 PathProgramCache]: Analyzing trace with hash 713576877, now seen corresponding path program 4 times [2019-12-27 20:00:59,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:59,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007847461] [2019-12-27 20:00:59,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:59,900 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 20:00:59,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007847461] [2019-12-27 20:00:59,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:59,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 20:00:59,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1890902031] [2019-12-27 20:00:59,901 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:59,915 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:00,273 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 265 states and 526 transitions. [2019-12-27 20:01:00,274 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:00,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:01:00,681 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 20:01:00,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 20:01:00,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:00,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 20:01:00,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:01:00,682 INFO L87 Difference]: Start difference. First operand 18233 states and 56683 transitions. Second operand 16 states. [2019-12-27 20:01:03,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:03,610 INFO L93 Difference]: Finished difference Result 30170 states and 92975 transitions. [2019-12-27 20:01:03,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 20:01:03,610 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 20:01:03,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:03,650 INFO L225 Difference]: With dead ends: 30170 [2019-12-27 20:01:03,650 INFO L226 Difference]: Without dead ends: 29219 [2019-12-27 20:01:03,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 20:01:03,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29219 states. [2019-12-27 20:01:03,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29219 to 17701. [2019-12-27 20:01:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17701 states. [2019-12-27 20:01:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17701 states to 17701 states and 55063 transitions. [2019-12-27 20:01:04,012 INFO L78 Accepts]: Start accepts. Automaton has 17701 states and 55063 transitions. Word has length 67 [2019-12-27 20:01:04,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:04,012 INFO L462 AbstractCegarLoop]: Abstraction has 17701 states and 55063 transitions. [2019-12-27 20:01:04,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 20:01:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 17701 states and 55063 transitions. [2019-12-27 20:01:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:01:04,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:04,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:01:04,032 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:01:04,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:04,032 INFO L82 PathProgramCache]: Analyzing trace with hash -998115875, now seen corresponding path program 5 times [2019-12-27 20:01:04,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:04,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381908965] [2019-12-27 20:01:04,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:04,275 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 20:01:04,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381908965] [2019-12-27 20:01:04,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:04,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:01:04,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [66487241] [2019-12-27 20:01:04,277 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:04,287 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:04,468 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 415 transitions. [2019-12-27 20:01:04,468 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:04,517 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:01:04,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:01:04,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:04,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:01:04,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:01:04,518 INFO L87 Difference]: Start difference. First operand 17701 states and 55063 transitions. Second operand 11 states. [2019-12-27 20:01:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:06,140 INFO L93 Difference]: Finished difference Result 41805 states and 128953 transitions. [2019-12-27 20:01:06,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 20:01:06,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 20:01:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:06,184 INFO L225 Difference]: With dead ends: 41805 [2019-12-27 20:01:06,185 INFO L226 Difference]: Without dead ends: 30282 [2019-12-27 20:01:06,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=1133, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 20:01:06,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30282 states. [2019-12-27 20:01:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30282 to 17126. [2019-12-27 20:01:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17126 states. [2019-12-27 20:01:06,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17126 states to 17126 states and 53177 transitions. [2019-12-27 20:01:06,558 INFO L78 Accepts]: Start accepts. Automaton has 17126 states and 53177 transitions. Word has length 67 [2019-12-27 20:01:06,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:06,558 INFO L462 AbstractCegarLoop]: Abstraction has 17126 states and 53177 transitions. [2019-12-27 20:01:06,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:01:06,558 INFO L276 IsEmpty]: Start isEmpty. Operand 17126 states and 53177 transitions. [2019-12-27 20:01:06,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:01:06,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:06,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:01:06,577 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:01:06,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:06,577 INFO L82 PathProgramCache]: Analyzing trace with hash 869682389, now seen corresponding path program 6 times [2019-12-27 20:01:06,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:06,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013345025] [2019-12-27 20:01:06,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:06,761 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 20:01:06,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013345025] [2019-12-27 20:01:06,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:06,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:01:06,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [810266054] [2019-12-27 20:01:06,762 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:06,777 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:07,107 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 259 states and 498 transitions. [2019-12-27 20:01:07,107 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:07,317 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 20:01:07,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:01:07,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:07,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:01:07,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:01:07,318 INFO L87 Difference]: Start difference. First operand 17126 states and 53177 transitions. Second operand 14 states. [2019-12-27 20:01:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:09,193 INFO L93 Difference]: Finished difference Result 20890 states and 64511 transitions. [2019-12-27 20:01:09,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 20:01:09,194 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-27 20:01:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:09,226 INFO L225 Difference]: With dead ends: 20890 [2019-12-27 20:01:09,226 INFO L226 Difference]: Without dead ends: 20675 [2019-12-27 20:01:09,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:01:09,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20675 states. [2019-12-27 20:01:09,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20675 to 17030. [2019-12-27 20:01:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17030 states. [2019-12-27 20:01:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17030 states to 17030 states and 52913 transitions. [2019-12-27 20:01:09,517 INFO L78 Accepts]: Start accepts. Automaton has 17030 states and 52913 transitions. Word has length 67 [2019-12-27 20:01:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:09,518 INFO L462 AbstractCegarLoop]: Abstraction has 17030 states and 52913 transitions. [2019-12-27 20:01:09,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:01:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 17030 states and 52913 transitions. [2019-12-27 20:01:09,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:01:09,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:09,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:01:09,536 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:01:09,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:09,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1815001603, now seen corresponding path program 7 times [2019-12-27 20:01:09,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:09,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924634937] [2019-12-27 20:01:09,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:01:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:01:09,650 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:01:09,650 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:01:09,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~a$r_buff1_thd3~0_51) (= 0 v_~a$w_buff1_used~0_72) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t269~0.base_25| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t269~0.base_25|) |v_ULTIMATE.start_main_~#t269~0.offset_19| 0)) |v_#memory_int_19|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t269~0.base_25| 4)) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~__unbuffered_p2_EBX~0_14 0) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t269~0.base_25|)) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t269~0.base_25|) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_14) (= v_~a$r_buff0_thd3~0_77 0) (= v_~x~0_10 0) (= v_~a$r_buff0_thd1~0_27 0) (= 0 v_~a$w_buff0_used~0_113) (= v_~a$flush_delayed~0_13 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~__unbuffered_p2_EAX~0_13) (= 0 v_~a$w_buff1~0_26) (= v_~a$mem_tmp~0_10 0) (= v_~main$tmp_guard1~0_14 0) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t269~0.base_25| 1)) (= 0 v_~y~0_8) (= 0 v_~a$r_buff1_thd0~0_22) (= v_~a$r_buff0_thd2~0_21 0) (= |v_#NULL.offset_4| 0) (= 0 v_~a$r_buff1_thd2~0_17) (= 0 v_~a$w_buff0~0_26) (= 0 v_~z~0_8) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~a$r_buff1_thd1~0_17) (= v_~main$tmp_guard0~0_11 0) (= v_~a$r_buff0_thd0~0_21 0) (= |v_ULTIMATE.start_main_~#t269~0.offset_19| 0) (= v_~a~0_27 0) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ULTIMATE.start_main_~#t270~0.offset=|v_ULTIMATE.start_main_~#t270~0.offset_17|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t271~0.offset=|v_ULTIMATE.start_main_~#t271~0.offset_17|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ULTIMATE.start_main_~#t271~0.base=|v_ULTIMATE.start_main_~#t271~0.base_21|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_26, ~y~0=v_~y~0_8, ULTIMATE.start_main_~#t269~0.base=|v_ULTIMATE.start_main_~#t269~0.base_25|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t269~0.offset=|v_ULTIMATE.start_main_~#t269~0.offset_19|, ULTIMATE.start_main_~#t270~0.base=|v_ULTIMATE.start_main_~#t270~0.base_21|, ~z~0=v_~z~0_8, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t270~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t271~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t271~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t269~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t269~0.offset, ULTIMATE.start_main_~#t270~0.base, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 20:01:09,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= v_~a$w_buff0_used~0_92 1) (= 0 (mod v_~a$w_buff1_used~0_57 256)) (= v_~a$w_buff0_used~0_93 v_~a$w_buff1_used~0_57) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8) (= v_~a$w_buff0~0_16 v_~a$w_buff1~0_18) (= 1 v_~a$w_buff0~0_15) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_18, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_15, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_92, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 20:01:09,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L837-1-->L839: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t270~0.base_12| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t270~0.base_12| 0)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t270~0.base_12|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t270~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t270~0.offset_10|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t270~0.base_12| 1) |v_#valid_34|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t270~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t270~0.base_12|) |v_ULTIMATE.start_main_~#t270~0.offset_10| 1)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t270~0.offset=|v_ULTIMATE.start_main_~#t270~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t270~0.base=|v_ULTIMATE.start_main_~#t270~0.base_12|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t270~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t270~0.base, #length] because there is no mapped edge [2019-12-27 20:01:09,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L839-1-->L841: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t271~0.base_12| 4)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t271~0.base_12| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t271~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t271~0.base_12|) |v_ULTIMATE.start_main_~#t271~0.offset_10| 2)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t271~0.offset_10|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t271~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t271~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t271~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t271~0.base=|v_ULTIMATE.start_main_~#t271~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t271~0.offset=|v_ULTIMATE.start_main_~#t271~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t271~0.base, ULTIMATE.start_main_~#t271~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 20:01:09,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1925624632 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1925624632 256) 0))) (or (and (= ~a$w_buff1~0_In-1925624632 |P1Thread1of1ForFork2_#t~ite9_Out-1925624632|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a~0_In-1925624632 |P1Thread1of1ForFork2_#t~ite9_Out-1925624632|)))) InVars {~a~0=~a~0_In-1925624632, ~a$w_buff1~0=~a$w_buff1~0_In-1925624632, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1925624632, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1925624632} OutVars{~a~0=~a~0_In-1925624632, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1925624632|, ~a$w_buff1~0=~a$w_buff1~0_In-1925624632, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1925624632, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1925624632} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 20:01:09,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= v_~a~0_18 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_18, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 20:01:09,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-567527046 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-567527046 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-567527046|)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-567527046| ~a$w_buff0_used~0_In-567527046) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-567527046, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-567527046} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-567527046, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-567527046, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-567527046|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 20:01:09,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In2136151283 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2136151283 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out2136151283|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In2136151283 |P0Thread1of1ForFork1_#t~ite5_Out2136151283|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2136151283, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2136151283} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out2136151283|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2136151283, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2136151283} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 20:01:09,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd1~0_In-1897653740 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1897653740 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In-1897653740 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1897653740 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1897653740|)) (and (= ~a$w_buff1_used~0_In-1897653740 |P0Thread1of1ForFork1_#t~ite6_Out-1897653740|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1897653740, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1897653740, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1897653740, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1897653740} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1897653740|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1897653740, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1897653740, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1897653740, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1897653740} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 20:01:09,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1603892514 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1603892514 256) 0))) (or (and (= ~a$r_buff0_thd1~0_In1603892514 ~a$r_buff0_thd1~0_Out1603892514) (or .cse0 .cse1)) (and (= 0 ~a$r_buff0_thd1~0_Out1603892514) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1603892514, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1603892514} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1603892514|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1603892514, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1603892514} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:01:09,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-62390378 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-62390378 256))) (.cse3 (= (mod ~a$r_buff1_thd1~0_In-62390378 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-62390378 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-62390378| ~a$r_buff1_thd1~0_In-62390378) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-62390378| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-62390378, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-62390378, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-62390378, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-62390378} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-62390378|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-62390378, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-62390378, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-62390378, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-62390378} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 20:01:09,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L756-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:01:09,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-308777743 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-308777743| |P2Thread1of1ForFork0_#t~ite20_Out-308777743|) (= |P2Thread1of1ForFork0_#t~ite21_Out-308777743| ~a$w_buff0~0_In-308777743)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out-308777743| |P2Thread1of1ForFork0_#t~ite20_Out-308777743|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-308777743 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-308777743 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-308777743 256))) (and (= 0 (mod ~a$w_buff1_used~0_In-308777743 256)) .cse1))) (= ~a$w_buff0~0_In-308777743 |P2Thread1of1ForFork0_#t~ite20_Out-308777743|) .cse0))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-308777743, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-308777743, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-308777743, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-308777743, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-308777743, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-308777743|, ~weak$$choice2~0=~weak$$choice2~0_In-308777743} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-308777743|, ~a$w_buff0~0=~a$w_buff0~0_In-308777743, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-308777743, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-308777743, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-308777743, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-308777743|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-308777743, ~weak$$choice2~0=~weak$$choice2~0_In-308777743} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 20:01:09,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L805-->L805-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In868500827 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_Out868500827| ~a$w_buff0_used~0_In868500827) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In868500827 256)))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In868500827 256))) (= (mod ~a$w_buff0_used~0_In868500827 256) 0) (and (= (mod ~a$w_buff1_used~0_In868500827 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite27_Out868500827| |P2Thread1of1ForFork0_#t~ite26_Out868500827|)) (and (= |P2Thread1of1ForFork0_#t~ite27_Out868500827| ~a$w_buff0_used~0_In868500827) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In868500827| |P2Thread1of1ForFork0_#t~ite26_Out868500827|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In868500827|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In868500827, ~a$w_buff0_used~0=~a$w_buff0_used~0_In868500827, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In868500827, ~a$w_buff1_used~0=~a$w_buff1_used~0_In868500827, ~weak$$choice2~0=~weak$$choice2~0_In868500827} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out868500827|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out868500827|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In868500827, ~a$w_buff0_used~0=~a$w_buff0_used~0_In868500827, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In868500827, ~a$w_buff1_used~0=~a$w_buff1_used~0_In868500827, ~weak$$choice2~0=~weak$$choice2~0_In868500827} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 20:01:09,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~a$r_buff0_thd3~0_47 v_~a$r_buff0_thd3~0_46)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_46, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 20:01:09,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (= v_~a~0_17 v_~a$mem_tmp~0_4) (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_17, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 20:01:09,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1146500534| |P2Thread1of1ForFork0_#t~ite39_Out1146500534|)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1146500534 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1146500534 256) 0))) (or (and (not .cse0) (not .cse1) .cse2 (= ~a$w_buff1~0_In1146500534 |P2Thread1of1ForFork0_#t~ite38_Out1146500534|)) (and .cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1146500534| ~a~0_In1146500534) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In1146500534, ~a$w_buff1~0=~a$w_buff1~0_In1146500534, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1146500534, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1146500534} OutVars{~a~0=~a~0_In1146500534, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1146500534|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1146500534|, ~a$w_buff1~0=~a$w_buff1~0_In1146500534, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1146500534, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1146500534} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 20:01:09,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In137753088 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In137753088 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out137753088| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out137753088| ~a$w_buff0_used~0_In137753088) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In137753088, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In137753088} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out137753088|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In137753088, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In137753088} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 20:01:09,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In2052412291 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In2052412291 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In2052412291 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In2052412291 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out2052412291|)) (and (= ~a$w_buff1_used~0_In2052412291 |P2Thread1of1ForFork0_#t~ite41_Out2052412291|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2052412291, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2052412291, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2052412291, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2052412291} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2052412291, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2052412291, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2052412291, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2052412291, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out2052412291|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 20:01:09,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1107761113 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1107761113 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In1107761113 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In1107761113 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out1107761113| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out1107761113| ~a$w_buff1_used~0_In1107761113)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1107761113, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1107761113, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1107761113, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1107761113} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1107761113, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1107761113, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1107761113, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1107761113|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1107761113} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 20:01:09,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1408643207 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1408643207 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1408643207| ~a$r_buff0_thd2~0_In-1408643207)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-1408643207| 0) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1408643207, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1408643207} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1408643207, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1408643207, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1408643207|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 20:01:09,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In117331321 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In117331321 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In117331321 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd2~0_In117331321 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out117331321|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~a$r_buff1_thd2~0_In117331321 |P1Thread1of1ForFork2_#t~ite14_Out117331321|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In117331321, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In117331321, ~a$w_buff0_used~0=~a$w_buff0_used~0_In117331321, ~a$w_buff1_used~0=~a$w_buff1_used~0_In117331321} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In117331321, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In117331321, ~a$w_buff0_used~0=~a$w_buff0_used~0_In117331321, ~a$w_buff1_used~0=~a$w_buff1_used~0_In117331321, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out117331321|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 20:01:09,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L782-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_11) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 20:01:09,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1979513413 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1979513413 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1979513413| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1979513413| ~a$r_buff0_thd3~0_In-1979513413)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1979513413, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1979513413} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1979513413, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1979513413, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1979513413|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 20:01:09,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd3~0_In-1262667192 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-1262667192 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In-1262667192 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1262667192 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1262667192| ~a$r_buff1_thd3~0_In-1262667192) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1262667192| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1262667192, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1262667192, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1262667192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1262667192} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1262667192|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1262667192, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1262667192, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1262667192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1262667192} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 20:01:09,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_45 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 20:01:09,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:01:09,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In-1784195273 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1784195273 256) 0))) (or (and (= ~a~0_In-1784195273 |ULTIMATE.start_main_#t~ite47_Out-1784195273|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-1784195273 |ULTIMATE.start_main_#t~ite47_Out-1784195273|)))) InVars {~a~0=~a~0_In-1784195273, ~a$w_buff1~0=~a$w_buff1~0_In-1784195273, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1784195273, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1784195273} OutVars{~a~0=~a~0_In-1784195273, ~a$w_buff1~0=~a$w_buff1~0_In-1784195273, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1784195273|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1784195273, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1784195273} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 20:01:09,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_19 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 20:01:09,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-2057086536 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-2057086536 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-2057086536|)) (and (= ~a$w_buff0_used~0_In-2057086536 |ULTIMATE.start_main_#t~ite49_Out-2057086536|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2057086536, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2057086536} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2057086536, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-2057086536|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2057086536} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 20:01:09,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In353578402 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In353578402 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In353578402 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd0~0_In353578402 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out353578402| ~a$w_buff1_used~0_In353578402) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out353578402| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In353578402, ~a$w_buff0_used~0=~a$w_buff0_used~0_In353578402, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In353578402, ~a$w_buff1_used~0=~a$w_buff1_used~0_In353578402} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out353578402|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In353578402, ~a$w_buff0_used~0=~a$w_buff0_used~0_In353578402, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In353578402, ~a$w_buff1_used~0=~a$w_buff1_used~0_In353578402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 20:01:09,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1871633855 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1871633855 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1871633855| ~a$r_buff0_thd0~0_In1871633855)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1871633855| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1871633855, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1871633855} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1871633855|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1871633855, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1871633855} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 20:01:09,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In1696780390 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In1696780390 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1696780390 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1696780390 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1696780390| ~a$r_buff1_thd0~0_In1696780390) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out1696780390| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1696780390, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1696780390, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1696780390, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1696780390} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1696780390|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1696780390, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1696780390, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1696780390, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1696780390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 20:01:09,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p0_EAX~0_9 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~main$tmp_guard1~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start_main_#t~ite52_14| v_~a$r_buff1_thd0~0_14) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_7 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:01:09,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:01:09 BasicIcfg [2019-12-27 20:01:09,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:01:09,768 INFO L168 Benchmark]: Toolchain (without parser) took 117191.64 ms. Allocated memory was 137.9 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 101.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 20:01:09,769 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 20:01:09,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.92 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 155.1 MB in the end (delta: -54.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:01:09,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.71 ms. Allocated memory is still 201.9 MB. Free memory was 155.1 MB in the beginning and 152.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:01:09,771 INFO L168 Benchmark]: Boogie Preprocessor took 43.69 ms. Allocated memory is still 201.9 MB. Free memory was 152.3 MB in the beginning and 149.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:01:09,771 INFO L168 Benchmark]: RCFGBuilder took 838.35 ms. Allocated memory is still 201.9 MB. Free memory was 149.6 MB in the beginning and 99.1 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:01:09,777 INFO L168 Benchmark]: TraceAbstraction took 115454.89 ms. Allocated memory was 201.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 20:01:09,782 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.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.92 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 155.1 MB in the end (delta: -54.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.71 ms. Allocated memory is still 201.9 MB. Free memory was 155.1 MB in the beginning and 152.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.69 ms. Allocated memory is still 201.9 MB. Free memory was 152.3 MB in the beginning and 149.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 838.35 ms. Allocated memory is still 201.9 MB. Free memory was 149.6 MB in the beginning and 99.1 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 115454.89 ms. Allocated memory was 201.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 179 ProgramPointsBefore, 97 ProgramPointsAfterwards, 216 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 30 ChoiceCompositions, 6465 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 95714 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 115.0s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 38.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5260 SDtfs, 7172 SDslu, 21307 SDs, 0 SdLazy, 16182 SolverSat, 434 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 111 SyntacticMatches, 61 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184385occurred 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: 36.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 165444 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1146 NumberOfCodeBlocks, 1146 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1055 ConstructedInterpolants, 0 QuantifiedInterpolants, 243365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...