/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:49:30,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:49:30,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:49:30,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:49:30,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:49:30,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:49:30,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:49:30,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:49:30,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:49:30,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:49:30,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:49:30,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:49:30,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:49:30,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:49:30,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:49:30,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:49:30,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:49:30,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:49:30,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:49:30,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:49:30,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:49:30,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:49:30,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:49:30,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:49:30,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:49:30,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:49:30,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:49:30,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:49:30,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:49:30,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:49:30,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:49:30,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:49:30,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:49:30,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:49:30,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:49:30,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:49:30,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:49:30,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:49:30,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:49:30,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:49:30,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:49:30,312 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:49:30,350 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:49:30,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:49:30,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:49:30,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:49:30,352 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:49:30,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:49:30,355 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:49:30,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:49:30,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:49:30,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:49:30,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:49:30,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:49:30,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:49:30,357 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:49:30,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:49:30,357 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:49:30,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:49:30,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:49:30,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:49:30,358 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:49:30,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:49:30,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:49:30,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:49:30,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:49:30,359 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:49:30,359 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:49:30,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:49:30,359 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:49:30,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:49:30,360 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:49:30,360 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:49:30,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:49:30,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:49:30,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:49:30,656 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:49:30,657 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:49:30,658 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i [2019-12-27 16:49:30,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24be75a5f/a7272b11e75640b1af1d5ad55d75d65e/FLAG978efbf48 [2019-12-27 16:49:31,347 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:49:31,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i [2019-12-27 16:49:31,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24be75a5f/a7272b11e75640b1af1d5ad55d75d65e/FLAG978efbf48 [2019-12-27 16:49:31,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24be75a5f/a7272b11e75640b1af1d5ad55d75d65e [2019-12-27 16:49:31,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:49:31,580 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:49:31,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:49:31,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:49:31,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:49:31,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:49:31" (1/1) ... [2019-12-27 16:49:31,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c41393e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:31, skipping insertion in model container [2019-12-27 16:49:31,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:49:31" (1/1) ... [2019-12-27 16:49:31,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:49:31,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:49:32,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:49:32,213 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:49:32,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:49:32,349 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:49:32,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:32 WrapperNode [2019-12-27 16:49:32,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:49:32,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:49:32,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:49:32,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:49:32,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:32" (1/1) ... [2019-12-27 16:49:32,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:32" (1/1) ... [2019-12-27 16:49:32,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:49:32,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:49:32,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:49:32,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:49:32,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:32" (1/1) ... [2019-12-27 16:49:32,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:32" (1/1) ... [2019-12-27 16:49:32,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:32" (1/1) ... [2019-12-27 16:49:32,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:32" (1/1) ... [2019-12-27 16:49:32,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:32" (1/1) ... [2019-12-27 16:49:32,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:32" (1/1) ... [2019-12-27 16:49:32,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:32" (1/1) ... [2019-12-27 16:49:32,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:49:32,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:49:32,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:49:32,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:49:32,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:32" (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 16:49:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:49:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:49:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:49:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:49:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:49:32,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:49:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:49:32,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:49:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:49:32,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:49:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:49:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:49:32,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:49:32,538 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 16:49:33,274 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:49:33,274 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:49:33,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:49:33 BoogieIcfgContainer [2019-12-27 16:49:33,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:49:33,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:49:33,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:49:33,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:49:33,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:49:31" (1/3) ... [2019-12-27 16:49:33,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666bec14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:49:33, skipping insertion in model container [2019-12-27 16:49:33,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:49:32" (2/3) ... [2019-12-27 16:49:33,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666bec14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:49:33, skipping insertion in model container [2019-12-27 16:49:33,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:49:33" (3/3) ... [2019-12-27 16:49:33,285 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_rmo.opt.i [2019-12-27 16:49:33,297 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:49:33,297 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:49:33,305 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:49:33,307 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:49:33,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,349 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,350 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,374 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,374 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,375 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,375 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,375 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,411 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,411 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,421 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,422 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,428 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,429 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,430 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,435 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,435 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:49:33,451 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:49:33,467 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:49:33,468 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:49:33,468 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:49:33,468 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:49:33,468 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:49:33,468 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:49:33,468 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:49:33,468 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:49:33,485 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-27 16:49:33,486 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 16:49:33,589 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 16:49:33,589 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:49:33,605 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 16:49:33,630 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 16:49:33,683 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 16:49:33,684 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:49:33,691 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 16:49:33,711 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 16:49:33,712 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:49:36,933 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-12-27 16:49:39,126 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 16:49:39,281 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 16:49:39,412 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66821 [2019-12-27 16:49:39,412 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 16:49:39,416 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-27 16:49:50,689 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-27 16:49:50,691 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-27 16:49:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 16:49:50,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:49:50,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 16:49:50,698 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:49:50,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:49:50,702 INFO L82 PathProgramCache]: Analyzing trace with hash 802094366, now seen corresponding path program 1 times [2019-12-27 16:49:50,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:49:50,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142819759] [2019-12-27 16:49:50,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:49:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:49:50,926 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 16:49:50,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142819759] [2019-12-27 16:49:50,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:49:50,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:49:50,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1153493293] [2019-12-27 16:49:50,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:49:50,935 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:49:50,949 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 16:49:50,949 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:49:50,953 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:49:50,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:49:50,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:49:50,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:49:50,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:49:50,970 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-27 16:49:54,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:49:54,077 INFO L93 Difference]: Finished difference Result 87938 states and 378592 transitions. [2019-12-27 16:49:54,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:49:54,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 16:49:54,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:49:54,632 INFO L225 Difference]: With dead ends: 87938 [2019-12-27 16:49:54,632 INFO L226 Difference]: Without dead ends: 82842 [2019-12-27 16:49:54,636 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 16:49:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82842 states. [2019-12-27 16:50:01,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82842 to 82842. [2019-12-27 16:50:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82842 states. [2019-12-27 16:50:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82842 states to 82842 states and 356178 transitions. [2019-12-27 16:50:02,558 INFO L78 Accepts]: Start accepts. Automaton has 82842 states and 356178 transitions. Word has length 5 [2019-12-27 16:50:02,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:02,559 INFO L462 AbstractCegarLoop]: Abstraction has 82842 states and 356178 transitions. [2019-12-27 16:50:02,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:50:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand 82842 states and 356178 transitions. [2019-12-27 16:50:02,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:50:02,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:02,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:50:02,569 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:02,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:02,570 INFO L82 PathProgramCache]: Analyzing trace with hash -136321435, now seen corresponding path program 1 times [2019-12-27 16:50:02,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:02,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631228298] [2019-12-27 16:50:02,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:50:02,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631228298] [2019-12-27 16:50:02,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:02,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:50:02,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2035801029] [2019-12-27 16:50:02,661 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:02,662 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:02,666 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:50:02,667 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:02,667 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:50:02,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:50:02,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:02,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:50:02,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:50:02,669 INFO L87 Difference]: Start difference. First operand 82842 states and 356178 transitions. Second operand 3 states. [2019-12-27 16:50:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:03,018 INFO L93 Difference]: Finished difference Result 21610 states and 74688 transitions. [2019-12-27 16:50:03,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:50:03,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:50:03,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:03,145 INFO L225 Difference]: With dead ends: 21610 [2019-12-27 16:50:03,146 INFO L226 Difference]: Without dead ends: 21610 [2019-12-27 16:50:03,146 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 16:50:06,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21610 states. [2019-12-27 16:50:06,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21610 to 21610. [2019-12-27 16:50:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21610 states. [2019-12-27 16:50:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21610 states to 21610 states and 74688 transitions. [2019-12-27 16:50:06,705 INFO L78 Accepts]: Start accepts. Automaton has 21610 states and 74688 transitions. Word has length 13 [2019-12-27 16:50:06,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:06,705 INFO L462 AbstractCegarLoop]: Abstraction has 21610 states and 74688 transitions. [2019-12-27 16:50:06,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:50:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 21610 states and 74688 transitions. [2019-12-27 16:50:06,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:50:06,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:06,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:50:06,709 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:06,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:06,710 INFO L82 PathProgramCache]: Analyzing trace with hash -120546049, now seen corresponding path program 1 times [2019-12-27 16:50:06,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:06,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802625160] [2019-12-27 16:50:06,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:06,790 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 16:50:06,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802625160] [2019-12-27 16:50:06,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:06,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:50:06,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [656825421] [2019-12-27 16:50:06,792 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:06,794 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:06,796 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:50:06,797 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:06,797 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:50:06,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:50:06,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:06,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:50:06,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:50:06,798 INFO L87 Difference]: Start difference. First operand 21610 states and 74688 transitions. Second operand 4 states. [2019-12-27 16:50:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:07,172 INFO L93 Difference]: Finished difference Result 31986 states and 107232 transitions. [2019-12-27 16:50:07,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:50:07,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 16:50:07,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:07,288 INFO L225 Difference]: With dead ends: 31986 [2019-12-27 16:50:07,288 INFO L226 Difference]: Without dead ends: 31972 [2019-12-27 16:50:07,289 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 16:50:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31972 states. [2019-12-27 16:50:08,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31972 to 28300. [2019-12-27 16:50:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28300 states. [2019-12-27 16:50:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28300 states to 28300 states and 95848 transitions. [2019-12-27 16:50:08,435 INFO L78 Accepts]: Start accepts. Automaton has 28300 states and 95848 transitions. Word has length 13 [2019-12-27 16:50:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:08,436 INFO L462 AbstractCegarLoop]: Abstraction has 28300 states and 95848 transitions. [2019-12-27 16:50:08,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:50:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 28300 states and 95848 transitions. [2019-12-27 16:50:08,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:50:08,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:08,439 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:50:08,440 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:08,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:08,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2051868705, now seen corresponding path program 1 times [2019-12-27 16:50:08,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:08,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103564577] [2019-12-27 16:50:08,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:08,529 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 16:50:08,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103564577] [2019-12-27 16:50:08,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:08,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:50:08,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1880745135] [2019-12-27 16:50:08,530 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:08,532 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:08,535 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 16:50:08,535 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:08,622 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:50:08,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:50:08,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:08,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:50:08,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:50:08,624 INFO L87 Difference]: Start difference. First operand 28300 states and 95848 transitions. Second operand 7 states. [2019-12-27 16:50:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:09,310 INFO L93 Difference]: Finished difference Result 42745 states and 142288 transitions. [2019-12-27 16:50:09,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:50:09,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 16:50:09,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:09,396 INFO L225 Difference]: With dead ends: 42745 [2019-12-27 16:50:09,396 INFO L226 Difference]: Without dead ends: 42727 [2019-12-27 16:50:09,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:50:09,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42727 states. [2019-12-27 16:50:10,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42727 to 34163. [2019-12-27 16:50:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34163 states. [2019-12-27 16:50:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34163 states to 34163 states and 114786 transitions. [2019-12-27 16:50:10,343 INFO L78 Accepts]: Start accepts. Automaton has 34163 states and 114786 transitions. Word has length 14 [2019-12-27 16:50:10,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:10,344 INFO L462 AbstractCegarLoop]: Abstraction has 34163 states and 114786 transitions. [2019-12-27 16:50:10,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:50:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand 34163 states and 114786 transitions. [2019-12-27 16:50:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:50:10,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:10,354 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 16:50:10,354 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:10,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:10,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1808091808, now seen corresponding path program 1 times [2019-12-27 16:50:10,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:10,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137496931] [2019-12-27 16:50:10,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:10,501 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 16:50:10,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137496931] [2019-12-27 16:50:10,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:10,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:50:10,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1182550728] [2019-12-27 16:50:10,502 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:10,504 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:10,508 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 26 transitions. [2019-12-27 16:50:10,508 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:10,508 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:50:10,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:50:10,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:10,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:50:10,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:50:10,509 INFO L87 Difference]: Start difference. First operand 34163 states and 114786 transitions. Second operand 6 states. [2019-12-27 16:50:11,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:11,562 INFO L93 Difference]: Finished difference Result 52347 states and 172257 transitions. [2019-12-27 16:50:11,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:50:11,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 16:50:11,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:11,671 INFO L225 Difference]: With dead ends: 52347 [2019-12-27 16:50:11,671 INFO L226 Difference]: Without dead ends: 52317 [2019-12-27 16:50:11,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:50:11,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52317 states. [2019-12-27 16:50:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52317 to 34394. [2019-12-27 16:50:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34394 states. [2019-12-27 16:50:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34394 states to 34394 states and 114647 transitions. [2019-12-27 16:50:12,468 INFO L78 Accepts]: Start accepts. Automaton has 34394 states and 114647 transitions. Word has length 22 [2019-12-27 16:50:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:12,468 INFO L462 AbstractCegarLoop]: Abstraction has 34394 states and 114647 transitions. [2019-12-27 16:50:12,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:50:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 34394 states and 114647 transitions. [2019-12-27 16:50:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:50:12,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:12,484 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 16:50:12,484 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:12,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:12,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1844565345, now seen corresponding path program 1 times [2019-12-27 16:50:12,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:12,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358048024] [2019-12-27 16:50:12,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:12,577 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 16:50:12,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358048024] [2019-12-27 16:50:12,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:12,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:50:12,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1744372888] [2019-12-27 16:50:12,579 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:12,584 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:12,589 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 16:50:12,589 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:12,589 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:50:12,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:50:12,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:12,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:50:12,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:50:12,591 INFO L87 Difference]: Start difference. First operand 34394 states and 114647 transitions. Second operand 4 states. [2019-12-27 16:50:12,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:12,654 INFO L93 Difference]: Finished difference Result 13523 states and 41801 transitions. [2019-12-27 16:50:12,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:50:12,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 16:50:12,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:12,676 INFO L225 Difference]: With dead ends: 13523 [2019-12-27 16:50:12,676 INFO L226 Difference]: Without dead ends: 13523 [2019-12-27 16:50:12,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:50:12,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13523 states. [2019-12-27 16:50:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13523 to 13303. [2019-12-27 16:50:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13303 states. [2019-12-27 16:50:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13303 states to 13303 states and 41151 transitions. [2019-12-27 16:50:13,186 INFO L78 Accepts]: Start accepts. Automaton has 13303 states and 41151 transitions. Word has length 25 [2019-12-27 16:50:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:13,186 INFO L462 AbstractCegarLoop]: Abstraction has 13303 states and 41151 transitions. [2019-12-27 16:50:13,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:50:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 13303 states and 41151 transitions. [2019-12-27 16:50:13,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:50:13,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:13,207 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 16:50:13,208 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:13,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:13,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1639479592, now seen corresponding path program 1 times [2019-12-27 16:50:13,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:13,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702451698] [2019-12-27 16:50:13,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:13,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 16:50:13,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702451698] [2019-12-27 16:50:13,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:13,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:50:13,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1965940297] [2019-12-27 16:50:13,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:13,311 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:13,337 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 112 transitions. [2019-12-27 16:50:13,338 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:13,353 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:50:13,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:50:13,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:13,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:50:13,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:50:13,354 INFO L87 Difference]: Start difference. First operand 13303 states and 41151 transitions. Second operand 4 states. [2019-12-27 16:50:13,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:13,610 INFO L93 Difference]: Finished difference Result 18494 states and 55939 transitions. [2019-12-27 16:50:13,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:50:13,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 16:50:13,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:13,636 INFO L225 Difference]: With dead ends: 18494 [2019-12-27 16:50:13,636 INFO L226 Difference]: Without dead ends: 18494 [2019-12-27 16:50:13,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:50:13,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18494 states. [2019-12-27 16:50:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18494 to 12700. [2019-12-27 16:50:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12700 states. [2019-12-27 16:50:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12700 states to 12700 states and 38815 transitions. [2019-12-27 16:50:13,860 INFO L78 Accepts]: Start accepts. Automaton has 12700 states and 38815 transitions. Word has length 39 [2019-12-27 16:50:13,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:13,861 INFO L462 AbstractCegarLoop]: Abstraction has 12700 states and 38815 transitions. [2019-12-27 16:50:13,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:50:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 12700 states and 38815 transitions. [2019-12-27 16:50:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:50:13,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:13,879 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 16:50:13,879 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:13,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1144095462, now seen corresponding path program 1 times [2019-12-27 16:50:13,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:13,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273369966] [2019-12-27 16:50:13,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:13,969 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 16:50:13,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273369966] [2019-12-27 16:50:13,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:13,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:50:13,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1263250850] [2019-12-27 16:50:13,970 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:13,980 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:14,012 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 107 transitions. [2019-12-27 16:50:14,012 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:14,063 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:50:14,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:50:14,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:14,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:50:14,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:50:14,064 INFO L87 Difference]: Start difference. First operand 12700 states and 38815 transitions. Second operand 7 states. [2019-12-27 16:50:14,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:14,694 INFO L93 Difference]: Finished difference Result 17919 states and 54342 transitions. [2019-12-27 16:50:14,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:50:14,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:50:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:14,721 INFO L225 Difference]: With dead ends: 17919 [2019-12-27 16:50:14,722 INFO L226 Difference]: Without dead ends: 17919 [2019-12-27 16:50:14,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 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 16:50:14,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17919 states. [2019-12-27 16:50:14,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17919 to 16320. [2019-12-27 16:50:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16320 states. [2019-12-27 16:50:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16320 states to 16320 states and 49873 transitions. [2019-12-27 16:50:14,976 INFO L78 Accepts]: Start accepts. Automaton has 16320 states and 49873 transitions. Word has length 40 [2019-12-27 16:50:14,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:14,976 INFO L462 AbstractCegarLoop]: Abstraction has 16320 states and 49873 transitions. [2019-12-27 16:50:14,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:50:14,976 INFO L276 IsEmpty]: Start isEmpty. Operand 16320 states and 49873 transitions. [2019-12-27 16:50:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:50:15,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:15,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:50:15,002 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:15,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2007286560, now seen corresponding path program 2 times [2019-12-27 16:50:15,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:15,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901186597] [2019-12-27 16:50:15,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:15,071 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 16:50:15,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901186597] [2019-12-27 16:50:15,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:15,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:50:15,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [884458] [2019-12-27 16:50:15,072 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:15,080 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:15,108 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 109 transitions. [2019-12-27 16:50:15,108 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:15,109 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:50:15,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:50:15,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:15,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:50:15,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:50:15,110 INFO L87 Difference]: Start difference. First operand 16320 states and 49873 transitions. Second operand 5 states. [2019-12-27 16:50:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:15,208 INFO L93 Difference]: Finished difference Result 14953 states and 46364 transitions. [2019-12-27 16:50:15,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:50:15,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 16:50:15,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:15,240 INFO L225 Difference]: With dead ends: 14953 [2019-12-27 16:50:15,240 INFO L226 Difference]: Without dead ends: 14953 [2019-12-27 16:50:15,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:50:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14953 states. [2019-12-27 16:50:15,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14953 to 13921. [2019-12-27 16:50:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13921 states. [2019-12-27 16:50:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13921 states to 13921 states and 43359 transitions. [2019-12-27 16:50:15,835 INFO L78 Accepts]: Start accepts. Automaton has 13921 states and 43359 transitions. Word has length 40 [2019-12-27 16:50:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:15,835 INFO L462 AbstractCegarLoop]: Abstraction has 13921 states and 43359 transitions. [2019-12-27 16:50:15,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:50:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 13921 states and 43359 transitions. [2019-12-27 16:50:15,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 16:50:15,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:15,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:50:15,867 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:15,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:15,869 INFO L82 PathProgramCache]: Analyzing trace with hash 425228576, now seen corresponding path program 1 times [2019-12-27 16:50:15,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:15,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445462349] [2019-12-27 16:50:15,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:16,082 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 16:50:16,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445462349] [2019-12-27 16:50:16,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:16,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:50:16,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1807737222] [2019-12-27 16:50:16,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:16,099 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:16,204 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 257 transitions. [2019-12-27 16:50:16,204 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:16,384 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 16:50:16,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:50:16,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:16,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:50:16,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:50:16,385 INFO L87 Difference]: Start difference. First operand 13921 states and 43359 transitions. Second operand 12 states. [2019-12-27 16:50:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:18,212 INFO L93 Difference]: Finished difference Result 31249 states and 96830 transitions. [2019-12-27 16:50:18,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 16:50:18,213 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-27 16:50:18,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:18,245 INFO L225 Difference]: With dead ends: 31249 [2019-12-27 16:50:18,245 INFO L226 Difference]: Without dead ends: 22250 [2019-12-27 16:50:18,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2019-12-27 16:50:18,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22250 states. [2019-12-27 16:50:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22250 to 17210. [2019-12-27 16:50:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17210 states. [2019-12-27 16:50:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17210 states to 17210 states and 53206 transitions. [2019-12-27 16:50:18,529 INFO L78 Accepts]: Start accepts. Automaton has 17210 states and 53206 transitions. Word has length 55 [2019-12-27 16:50:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:18,530 INFO L462 AbstractCegarLoop]: Abstraction has 17210 states and 53206 transitions. [2019-12-27 16:50:18,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:50:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 17210 states and 53206 transitions. [2019-12-27 16:50:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 16:50:18,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:18,549 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] [2019-12-27 16:50:18,549 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:18,549 INFO L82 PathProgramCache]: Analyzing trace with hash 235395682, now seen corresponding path program 2 times [2019-12-27 16:50:18,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:18,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591769369] [2019-12-27 16:50:18,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:18,606 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 16:50:18,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591769369] [2019-12-27 16:50:18,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:18,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:50:18,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [152462269] [2019-12-27 16:50:18,607 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:18,623 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:18,954 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 230 transitions. [2019-12-27 16:50:18,954 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:18,967 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:50:18,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:50:18,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:18,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:50:18,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:50:18,968 INFO L87 Difference]: Start difference. First operand 17210 states and 53206 transitions. Second operand 3 states. [2019-12-27 16:50:19,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:19,068 INFO L93 Difference]: Finished difference Result 23156 states and 70253 transitions. [2019-12-27 16:50:19,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:50:19,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 16:50:19,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:19,100 INFO L225 Difference]: With dead ends: 23156 [2019-12-27 16:50:19,100 INFO L226 Difference]: Without dead ends: 23156 [2019-12-27 16:50:19,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 16:50:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23156 states. [2019-12-27 16:50:19,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23156 to 19339. [2019-12-27 16:50:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19339 states. [2019-12-27 16:50:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19339 states to 19339 states and 59397 transitions. [2019-12-27 16:50:19,392 INFO L78 Accepts]: Start accepts. Automaton has 19339 states and 59397 transitions. Word has length 55 [2019-12-27 16:50:19,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:19,392 INFO L462 AbstractCegarLoop]: Abstraction has 19339 states and 59397 transitions. [2019-12-27 16:50:19,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:50:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 19339 states and 59397 transitions. [2019-12-27 16:50:19,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 16:50:19,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:19,412 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] [2019-12-27 16:50:19,412 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:19,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:19,413 INFO L82 PathProgramCache]: Analyzing trace with hash 579382589, now seen corresponding path program 1 times [2019-12-27 16:50:19,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:19,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601431716] [2019-12-27 16:50:19,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:19,626 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 16:50:19,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601431716] [2019-12-27 16:50:19,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:19,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:50:19,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1699388862] [2019-12-27 16:50:19,628 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:19,652 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:19,788 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 230 transitions. [2019-12-27 16:50:19,789 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:19,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:50:19,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:50:20,057 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 16:50:20,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:50:20,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:20,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:50:20,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:50:20,058 INFO L87 Difference]: Start difference. First operand 19339 states and 59397 transitions. Second operand 14 states. [2019-12-27 16:50:24,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:24,235 INFO L93 Difference]: Finished difference Result 42826 states and 128044 transitions. [2019-12-27 16:50:24,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 16:50:24,235 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-12-27 16:50:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:24,296 INFO L225 Difference]: With dead ends: 42826 [2019-12-27 16:50:24,296 INFO L226 Difference]: Without dead ends: 42622 [2019-12-27 16:50:24,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=353, Invalid=1809, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 16:50:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42622 states. [2019-12-27 16:50:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42622 to 21282. [2019-12-27 16:50:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21282 states. [2019-12-27 16:50:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21282 states to 21282 states and 65303 transitions. [2019-12-27 16:50:24,761 INFO L78 Accepts]: Start accepts. Automaton has 21282 states and 65303 transitions. Word has length 55 [2019-12-27 16:50:24,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:24,762 INFO L462 AbstractCegarLoop]: Abstraction has 21282 states and 65303 transitions. [2019-12-27 16:50:24,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:50:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 21282 states and 65303 transitions. [2019-12-27 16:50:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 16:50:24,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:24,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:50:24,793 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:24,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:24,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1244789413, now seen corresponding path program 2 times [2019-12-27 16:50:24,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:24,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332508814] [2019-12-27 16:50:24,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:24,858 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 16:50:24,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332508814] [2019-12-27 16:50:24,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:24,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:50:24,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [124057402] [2019-12-27 16:50:24,859 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:24,890 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:25,073 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 240 states and 461 transitions. [2019-12-27 16:50:25,073 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:25,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:50:25,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:50:25,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:25,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:50:25,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:50:25,076 INFO L87 Difference]: Start difference. First operand 21282 states and 65303 transitions. Second operand 3 states. [2019-12-27 16:50:25,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:25,160 INFO L93 Difference]: Finished difference Result 21280 states and 65298 transitions. [2019-12-27 16:50:25,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:50:25,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 16:50:25,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:25,202 INFO L225 Difference]: With dead ends: 21280 [2019-12-27 16:50:25,203 INFO L226 Difference]: Without dead ends: 21280 [2019-12-27 16:50:25,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:50:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21280 states. [2019-12-27 16:50:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21280 to 16384. [2019-12-27 16:50:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16384 states. [2019-12-27 16:50:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16384 states to 16384 states and 51231 transitions. [2019-12-27 16:50:25,717 INFO L78 Accepts]: Start accepts. Automaton has 16384 states and 51231 transitions. Word has length 55 [2019-12-27 16:50:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:25,718 INFO L462 AbstractCegarLoop]: Abstraction has 16384 states and 51231 transitions. [2019-12-27 16:50:25,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:50:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 16384 states and 51231 transitions. [2019-12-27 16:50:25,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:50:25,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:25,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:50:25,745 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:25,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:25,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1211542094, now seen corresponding path program 1 times [2019-12-27 16:50:25,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:25,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038313005] [2019-12-27 16:50:25,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:26,225 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 16:50:26,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038313005] [2019-12-27 16:50:26,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:26,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 16:50:26,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [508449212] [2019-12-27 16:50:26,227 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:26,251 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:26,654 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 231 transitions. [2019-12-27 16:50:26,654 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:26,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:50:26,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 16:50:26,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:26,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 16:50:26,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:50:26,925 INFO L87 Difference]: Start difference. First operand 16384 states and 51231 transitions. Second operand 18 states. [2019-12-27 16:50:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:30,546 INFO L93 Difference]: Finished difference Result 26725 states and 81696 transitions. [2019-12-27 16:50:30,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 16:50:30,546 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-27 16:50:30,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:30,581 INFO L225 Difference]: With dead ends: 26725 [2019-12-27 16:50:30,581 INFO L226 Difference]: Without dead ends: 24475 [2019-12-27 16:50:30,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=326, Invalid=1654, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 16:50:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24475 states. [2019-12-27 16:50:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24475 to 16796. [2019-12-27 16:50:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16796 states. [2019-12-27 16:50:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16796 states to 16796 states and 52305 transitions. [2019-12-27 16:50:30,891 INFO L78 Accepts]: Start accepts. Automaton has 16796 states and 52305 transitions. Word has length 56 [2019-12-27 16:50:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:30,891 INFO L462 AbstractCegarLoop]: Abstraction has 16796 states and 52305 transitions. [2019-12-27 16:50:30,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 16:50:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 16796 states and 52305 transitions. [2019-12-27 16:50:30,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:50:30,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:30,910 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] [2019-12-27 16:50:30,911 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:30,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:30,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1521838778, now seen corresponding path program 2 times [2019-12-27 16:50:30,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:30,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572552456] [2019-12-27 16:50:30,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:31,290 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 16:50:31,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572552456] [2019-12-27 16:50:31,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:31,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 16:50:31,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [886595016] [2019-12-27 16:50:31,291 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:31,305 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:31,421 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 347 transitions. [2019-12-27 16:50:31,421 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:31,885 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-12-27 16:50:32,221 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 16:50:32,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 16:50:32,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:32,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 16:50:32,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:50:32,222 INFO L87 Difference]: Start difference. First operand 16796 states and 52305 transitions. Second operand 20 states. [2019-12-27 16:50:41,629 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-12-27 16:50:42,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:42,605 INFO L93 Difference]: Finished difference Result 53583 states and 163986 transitions. [2019-12-27 16:50:42,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-12-27 16:50:42,606 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-27 16:50:42,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:42,670 INFO L225 Difference]: With dead ends: 53583 [2019-12-27 16:50:42,670 INFO L226 Difference]: Without dead ends: 44065 [2019-12-27 16:50:42,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 16 SyntacticMatches, 11 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1954 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=933, Invalid=5547, Unknown=0, NotChecked=0, Total=6480 [2019-12-27 16:50:42,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44065 states. [2019-12-27 16:50:43,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44065 to 27296. [2019-12-27 16:50:43,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27296 states. [2019-12-27 16:50:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27296 states to 27296 states and 84537 transitions. [2019-12-27 16:50:43,183 INFO L78 Accepts]: Start accepts. Automaton has 27296 states and 84537 transitions. Word has length 56 [2019-12-27 16:50:43,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:43,183 INFO L462 AbstractCegarLoop]: Abstraction has 27296 states and 84537 transitions. [2019-12-27 16:50:43,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 16:50:43,183 INFO L276 IsEmpty]: Start isEmpty. Operand 27296 states and 84537 transitions. [2019-12-27 16:50:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:50:43,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:43,217 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] [2019-12-27 16:50:43,217 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:43,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:43,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1112243484, now seen corresponding path program 3 times [2019-12-27 16:50:43,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:43,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741249795] [2019-12-27 16:50:43,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:43,381 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 16:50:43,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741249795] [2019-12-27 16:50:43,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:43,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:50:43,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [200976298] [2019-12-27 16:50:43,382 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:43,397 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:43,551 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 221 states and 435 transitions. [2019-12-27 16:50:43,551 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:43,809 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 16:50:43,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 16:50:43,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:43,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 16:50:43,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:50:43,810 INFO L87 Difference]: Start difference. First operand 27296 states and 84537 transitions. Second operand 15 states. [2019-12-27 16:50:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:46,822 INFO L93 Difference]: Finished difference Result 45151 states and 138733 transitions. [2019-12-27 16:50:46,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 16:50:46,822 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 16:50:46,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:46,886 INFO L225 Difference]: With dead ends: 45151 [2019-12-27 16:50:46,886 INFO L226 Difference]: Without dead ends: 41591 [2019-12-27 16:50:46,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=305, Invalid=1417, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 16:50:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41591 states. [2019-12-27 16:50:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41591 to 29649. [2019-12-27 16:50:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29649 states. [2019-12-27 16:50:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29649 states to 29649 states and 92084 transitions. [2019-12-27 16:50:47,425 INFO L78 Accepts]: Start accepts. Automaton has 29649 states and 92084 transitions. Word has length 56 [2019-12-27 16:50:47,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:47,425 INFO L462 AbstractCegarLoop]: Abstraction has 29649 states and 92084 transitions. [2019-12-27 16:50:47,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 16:50:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 29649 states and 92084 transitions. [2019-12-27 16:50:47,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:50:47,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:47,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:50:47,462 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:47,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:47,462 INFO L82 PathProgramCache]: Analyzing trace with hash -445147212, now seen corresponding path program 4 times [2019-12-27 16:50:47,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:47,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434802710] [2019-12-27 16:50:47,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:47,648 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 16:50:47,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434802710] [2019-12-27 16:50:47,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:47,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:50:47,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1997339869] [2019-12-27 16:50:47,649 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:47,664 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:47,781 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 351 transitions. [2019-12-27 16:50:47,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:48,472 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 16:50:48,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 16:50:48,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:48,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 16:50:48,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:50:48,473 INFO L87 Difference]: Start difference. First operand 29649 states and 92084 transitions. Second operand 18 states. [2019-12-27 16:50:52,626 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2019-12-27 16:50:56,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:50:56,935 INFO L93 Difference]: Finished difference Result 66069 states and 202181 transitions. [2019-12-27 16:50:56,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-12-27 16:50:56,936 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-27 16:50:56,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:50:57,028 INFO L225 Difference]: With dead ends: 66069 [2019-12-27 16:50:57,028 INFO L226 Difference]: Without dead ends: 58443 [2019-12-27 16:50:57,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 17 SyntacticMatches, 16 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1986 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=991, Invalid=5489, Unknown=0, NotChecked=0, Total=6480 [2019-12-27 16:50:57,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58443 states. [2019-12-27 16:50:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58443 to 30639. [2019-12-27 16:50:57,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30639 states. [2019-12-27 16:50:57,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30639 states to 30639 states and 95335 transitions. [2019-12-27 16:50:57,700 INFO L78 Accepts]: Start accepts. Automaton has 30639 states and 95335 transitions. Word has length 56 [2019-12-27 16:50:57,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:50:57,700 INFO L462 AbstractCegarLoop]: Abstraction has 30639 states and 95335 transitions. [2019-12-27 16:50:57,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 16:50:57,700 INFO L276 IsEmpty]: Start isEmpty. Operand 30639 states and 95335 transitions. [2019-12-27 16:50:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:50:57,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:50:57,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:50:57,736 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:50:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:50:57,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2106032246, now seen corresponding path program 5 times [2019-12-27 16:50:57,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:50:57,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317377260] [2019-12-27 16:50:57,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:50:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:50:57,955 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 16:50:57,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317377260] [2019-12-27 16:50:57,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:50:57,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:50:57,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [427566959] [2019-12-27 16:50:57,957 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:50:57,971 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:50:58,407 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 221 states and 439 transitions. [2019-12-27 16:50:58,407 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:50:58,875 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 40 times. [2019-12-27 16:50:58,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 16:50:58,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:50:58,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 16:50:58,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:50:58,876 INFO L87 Difference]: Start difference. First operand 30639 states and 95335 transitions. Second operand 18 states. [2019-12-27 16:51:06,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:51:06,127 INFO L93 Difference]: Finished difference Result 78255 states and 241599 transitions. [2019-12-27 16:51:06,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-27 16:51:06,127 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-27 16:51:06,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:51:06,244 INFO L225 Difference]: With dead ends: 78255 [2019-12-27 16:51:06,245 INFO L226 Difference]: Without dead ends: 73110 [2019-12-27 16:51:06,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 23 SyntacticMatches, 15 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=864, Invalid=4836, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 16:51:06,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73110 states. [2019-12-27 16:51:07,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73110 to 31482. [2019-12-27 16:51:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31482 states. [2019-12-27 16:51:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31482 states to 31482 states and 98046 transitions. [2019-12-27 16:51:07,380 INFO L78 Accepts]: Start accepts. Automaton has 31482 states and 98046 transitions. Word has length 56 [2019-12-27 16:51:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:51:07,380 INFO L462 AbstractCegarLoop]: Abstraction has 31482 states and 98046 transitions. [2019-12-27 16:51:07,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 16:51:07,380 INFO L276 IsEmpty]: Start isEmpty. Operand 31482 states and 98046 transitions. [2019-12-27 16:51:07,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:51:07,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:51:07,414 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] [2019-12-27 16:51:07,414 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:51:07,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:51:07,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1886942222, now seen corresponding path program 6 times [2019-12-27 16:51:07,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:51:07,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287507800] [2019-12-27 16:51:07,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:51:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:51:07,662 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 16:51:07,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287507800] [2019-12-27 16:51:07,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:51:07,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:51:07,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [717337794] [2019-12-27 16:51:07,663 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:51:07,677 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:51:07,846 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 175 states and 318 transitions. [2019-12-27 16:51:07,846 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:51:08,302 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 16:51:08,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 16:51:08,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:51:08,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 16:51:08,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:51:08,304 INFO L87 Difference]: Start difference. First operand 31482 states and 98046 transitions. Second operand 18 states. [2019-12-27 16:51:14,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:51:14,387 INFO L93 Difference]: Finished difference Result 68982 states and 212340 transitions. [2019-12-27 16:51:14,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-12-27 16:51:14,388 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-27 16:51:14,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:51:14,492 INFO L225 Difference]: With dead ends: 68982 [2019-12-27 16:51:14,492 INFO L226 Difference]: Without dead ends: 66850 [2019-12-27 16:51:14,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2589 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1235, Invalid=6775, Unknown=0, NotChecked=0, Total=8010 [2019-12-27 16:51:14,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66850 states. [2019-12-27 16:51:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66850 to 37764. [2019-12-27 16:51:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37764 states. [2019-12-27 16:51:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37764 states to 37764 states and 117551 transitions. [2019-12-27 16:51:15,256 INFO L78 Accepts]: Start accepts. Automaton has 37764 states and 117551 transitions. Word has length 56 [2019-12-27 16:51:15,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:51:15,257 INFO L462 AbstractCegarLoop]: Abstraction has 37764 states and 117551 transitions. [2019-12-27 16:51:15,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 16:51:15,257 INFO L276 IsEmpty]: Start isEmpty. Operand 37764 states and 117551 transitions. [2019-12-27 16:51:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 16:51:15,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:51:15,300 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] [2019-12-27 16:51:15,300 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:51:15,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:51:15,300 INFO L82 PathProgramCache]: Analyzing trace with hash -196673722, now seen corresponding path program 7 times [2019-12-27 16:51:15,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:51:15,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605289017] [2019-12-27 16:51:15,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:51:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:51:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:51:15,437 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:51:15,437 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:51:15,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t928~0.base_21| 4)) (= 0 v_~x$r_buff1_thd2~0_202) (= v_~weak$$choice2~0_155 0) (= |v_ULTIMATE.start_main_~#t928~0.offset_16| 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t928~0.base_21|) (= v_~z~0_13 0) (= v_~__unbuffered_cnt~0_148 0) (= 0 v_~__unbuffered_p0_EAX~0_46) (= v_~x$r_buff0_thd1~0_322 0) (= 0 v_~x$r_buff0_thd2~0_247) (= v_~x$flush_delayed~0_68 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$w_buff1_used~0_539) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~weak$$choice0~0_35) (= v_~x$r_buff1_thd1~0_293 0) (= v_~x$r_buff0_thd0~0_140 0) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~x$w_buff0~0_441) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~x~0_192) (= v_~main$tmp_guard0~0_20 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t928~0.base_21| 1)) (= v_~y~0_44 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~x$w_buff1~0_298) (= |v_#NULL.offset_4| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t928~0.base_21|)) (= 0 v_~x$r_buff1_thd3~0_209) (= v_~__unbuffered_p1_EAX~0_150 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0_used~0_964) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t928~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t928~0.base_21|) |v_ULTIMATE.start_main_~#t928~0.offset_16| 0)) |v_#memory_int_23|) (= v_~x$r_buff1_thd0~0_215 0) (= v_~x$mem_tmp~0_38 0) (= v_~a~0_41 0) (= 0 v_~x$r_buff0_thd3~0_132))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_441, ~x$flush_delayed~0=v_~x$flush_delayed~0_68, ULTIMATE.start_main_~#t929~0.offset=|v_ULTIMATE.start_main_~#t929~0.offset_16|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_293, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_270|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~a~0=v_~a~0_41, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_150, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t929~0.base=|v_ULTIMATE.start_main_~#t929~0.base_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ULTIMATE.start_main_~#t930~0.offset=|v_ULTIMATE.start_main_~#t930~0.offset_15|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_298, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_539, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_202, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_35, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t928~0.offset=|v_ULTIMATE.start_main_~#t928~0.offset_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_148, ~x~0=v_~x~0_192, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_322, ULTIMATE.start_main_~#t930~0.base=|v_ULTIMATE.start_main_~#t930~0.base_19|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_72|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_209, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_38, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y~0=v_~y~0_44, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_215, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_247, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_964, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_44|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t928~0.base=|v_ULTIMATE.start_main_~#t928~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_13, ~weak$$choice2~0=v_~weak$$choice2~0_155, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t929~0.offset, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t929~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t930~0.offset, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t928~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t930~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t928~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 16:51:15,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L828-1-->L830: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t929~0.base_13|) 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t929~0.base_13| 1) |v_#valid_36|) (= |v_ULTIMATE.start_main_~#t929~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t929~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t929~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t929~0.base_13|) |v_ULTIMATE.start_main_~#t929~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t929~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t929~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t929~0.offset=|v_ULTIMATE.start_main_~#t929~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t929~0.base=|v_ULTIMATE.start_main_~#t929~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t929~0.offset, #length, ULTIMATE.start_main_~#t929~0.base] because there is no mapped edge [2019-12-27 16:51:15,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L830-1-->L832: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t930~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t930~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t930~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t930~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t930~0.base_13|) |v_ULTIMATE.start_main_~#t930~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t930~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t930~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t930~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t930~0.offset=|v_ULTIMATE.start_main_~#t930~0.offset_11|, ULTIMATE.start_main_~#t930~0.base=|v_ULTIMATE.start_main_~#t930~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t930~0.offset, ULTIMATE.start_main_~#t930~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 16:51:15,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= 1 v_~x$w_buff0~0_19) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= v_~x$w_buff0~0_20 v_~x$w_buff1~0_15) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= v_~x$w_buff1_used~0_44 v_~x$w_buff0_used~0_74) (= 1 v_~x$w_buff0_used~0_73) (= 0 (mod v_~x$w_buff1_used~0_44 256))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_74} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, ~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_73} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 16:51:15,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-167948511 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-167948511 256) 0))) (or (and (= ~x~0_In-167948511 |P2Thread1of1ForFork2_#t~ite32_Out-167948511|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite32_Out-167948511| ~x$w_buff1~0_In-167948511)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-167948511, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167948511, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-167948511, ~x~0=~x~0_In-167948511} OutVars{P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out-167948511|, ~x$w_buff1~0=~x$w_buff1~0_In-167948511, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167948511, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-167948511, ~x~0=~x~0_In-167948511} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 16:51:15,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1285197942 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1285197942 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-1285197942|)) (and (= ~x$w_buff0_used~0_In-1285197942 |P1Thread1of1ForFork1_#t~ite28_Out-1285197942|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1285197942, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1285197942} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1285197942, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1285197942|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1285197942} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 16:51:15,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L805-4-->L806: Formula: (= v_~x~0_35 |v_P2Thread1of1ForFork2_#t~ite32_12|) InVars {P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_12|} OutVars{P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_17|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_11|, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~x~0] because there is no mapped edge [2019-12-27 16:51:15,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1589019347 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1589019347 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite34_Out1589019347| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1589019347 |P2Thread1of1ForFork2_#t~ite34_Out1589019347|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1589019347, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1589019347} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out1589019347|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1589019347, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1589019347} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-27 16:51:15,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L807-->L807-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-215614730 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-215614730 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-215614730 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-215614730 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite35_Out-215614730|)) (and (= ~x$w_buff1_used~0_In-215614730 |P2Thread1of1ForFork2_#t~ite35_Out-215614730|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-215614730, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-215614730, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-215614730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-215614730} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out-215614730|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-215614730, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-215614730, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-215614730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-215614730} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-27 16:51:15,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In704582611 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In704582611 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In704582611 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In704582611 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out704582611|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In704582611 |P1Thread1of1ForFork1_#t~ite29_Out704582611|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In704582611, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In704582611, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In704582611, ~x$w_buff0_used~0=~x$w_buff0_used~0_In704582611} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out704582611|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In704582611, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In704582611, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In704582611, ~x$w_buff0_used~0=~x$w_buff0_used~0_In704582611} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 16:51:15,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L782-->L783: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-2122437527 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2122437527 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-2122437527 0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_Out-2122437527 ~x$r_buff0_thd2~0_In-2122437527) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2122437527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2122437527} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2122437527|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2122437527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2122437527} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 16:51:15,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1139800121 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1139800121 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1139800121 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1139800121 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite31_Out1139800121| ~x$r_buff1_thd2~0_In1139800121)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite31_Out1139800121| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1139800121, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1139800121, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1139800121, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1139800121} OutVars{P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1139800121|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1139800121, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1139800121, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1139800121, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1139800121} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 16:51:15,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~x$r_buff1_thd2~0_113 |v_P1Thread1of1ForFork1_#t~ite31_42|)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_41|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 16:51:15,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-566518751 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite11_Out-566518751| |P0Thread1of1ForFork0_#t~ite12_Out-566518751|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-566518751 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In-566518751 256) 0) .cse0) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-566518751 256))) (= (mod ~x$w_buff0_used~0_In-566518751 256) 0))) .cse1 (= |P0Thread1of1ForFork0_#t~ite11_Out-566518751| ~x$w_buff1~0_In-566518751)) (and (= |P0Thread1of1ForFork0_#t~ite12_Out-566518751| ~x$w_buff1~0_In-566518751) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite11_In-566518751| |P0Thread1of1ForFork0_#t~ite11_Out-566518751|)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-566518751|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-566518751, ~x$w_buff1~0=~x$w_buff1~0_In-566518751, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-566518751, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-566518751, ~weak$$choice2~0=~weak$$choice2~0_In-566518751, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-566518751} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-566518751|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-566518751, ~x$w_buff1~0=~x$w_buff1~0_In-566518751, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-566518751, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-566518751, ~weak$$choice2~0=~weak$$choice2~0_In-566518751, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-566518751|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-566518751} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 16:51:15,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L746-->L746-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1435481758 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite15_Out-1435481758| |P0Thread1of1ForFork0_#t~ite14_Out-1435481758|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1435481758 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In-1435481758 256) 0) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In-1435481758 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-1435481758 256) 0))) (= ~x$w_buff0_used~0_In-1435481758 |P0Thread1of1ForFork0_#t~ite14_Out-1435481758|)) (and (= |P0Thread1of1ForFork0_#t~ite14_In-1435481758| |P0Thread1of1ForFork0_#t~ite14_Out-1435481758|) (= ~x$w_buff0_used~0_In-1435481758 |P0Thread1of1ForFork0_#t~ite15_Out-1435481758|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1435481758, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1435481758, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1435481758, ~weak$$choice2~0=~weak$$choice2~0_In-1435481758, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_In-1435481758|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1435481758} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1435481758, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1435481758, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1435481758, P0Thread1of1ForFork0_#t~ite15=|P0Thread1of1ForFork0_#t~ite15_Out-1435481758|, ~weak$$choice2~0=~weak$$choice2~0_In-1435481758, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out-1435481758|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1435481758} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite15, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 16:51:15,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L748-->L749: Formula: (and (= v_~x$r_buff0_thd1~0_65 v_~x$r_buff0_thd1~0_64) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_64, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_7|, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite20, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 16:51:15,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L751-->L759: Formula: (and (= v_~x$flush_delayed~0_20 0) (= v_~x~0_54 v_~x$mem_tmp~0_15) (not (= (mod v_~x$flush_delayed~0_21 256) 0)) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 16:51:15,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-245131397 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-245131397 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite36_Out-245131397| ~x$r_buff0_thd3~0_In-245131397) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite36_Out-245131397| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-245131397, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-245131397} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-245131397|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-245131397, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-245131397} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 16:51:15,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1115176325 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In1115176325 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In1115176325 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1115176325 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite37_Out1115176325| ~x$r_buff1_thd3~0_In1115176325) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite37_Out1115176325|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1115176325, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1115176325, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1115176325, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1115176325} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out1115176325|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1115176325, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1115176325, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1115176325, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1115176325} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-27 16:51:15,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite37_46| v_~x$r_buff1_thd3~0_117)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_45|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_117, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 16:51:15,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L838: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:51:15,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L838-2-->L838-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1493355332 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1493355332 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out1493355332| ~x~0_In1493355332)) (and (= |ULTIMATE.start_main_#t~ite41_Out1493355332| ~x$w_buff1~0_In1493355332) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1493355332, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1493355332, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1493355332, ~x~0=~x~0_In1493355332} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1493355332|, ~x$w_buff1~0=~x$w_buff1~0_In1493355332, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1493355332, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1493355332, ~x~0=~x~0_In1493355332} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 16:51:15,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L838-4-->L839: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 16:51:15,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-2013708907 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2013708907 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-2013708907 |ULTIMATE.start_main_#t~ite43_Out-2013708907|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out-2013708907|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2013708907, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2013708907} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2013708907, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2013708907|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2013708907} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 16:51:15,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1488106554 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1488106554 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1488106554 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1488106554 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1488106554| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite44_Out-1488106554| ~x$w_buff1_used~0_In-1488106554)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1488106554, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1488106554, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1488106554, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1488106554} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1488106554, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1488106554, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1488106554, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1488106554|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1488106554} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:51:15,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-210090213 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-210090213 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-210090213|)) (and (= |ULTIMATE.start_main_#t~ite45_Out-210090213| ~x$r_buff0_thd0~0_In-210090213) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-210090213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-210090213} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-210090213, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-210090213|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-210090213} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:51:15,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L842-->L842-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1258650022 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1258650022 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1258650022 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1258650022 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1258650022| ~x$r_buff1_thd0~0_In-1258650022) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite46_Out-1258650022| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1258650022, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1258650022, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1258650022, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1258650022} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1258650022, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1258650022|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1258650022, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1258650022, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1258650022} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 16:51:15,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~__unbuffered_p1_EAX~0_139 0) (= v_~x$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite46_54|) (= v_~main$tmp_guard1~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~__unbuffered_p2_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p0_EAX~0_34)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_54|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_53|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_203, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:51:15,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:51:15 BasicIcfg [2019-12-27 16:51:15,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:51:15,551 INFO L168 Benchmark]: Toolchain (without parser) took 103972.03 ms. Allocated memory was 139.5 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 99.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 16:51:15,552 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 139.5 MB. Free memory was 120.1 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 16:51:15,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.11 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 99.4 MB in the beginning and 155.5 MB in the end (delta: -56.1 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:51:15,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.54 ms. Allocated memory is still 202.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:51:15,554 INFO L168 Benchmark]: Boogie Preprocessor took 40.56 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:51:15,554 INFO L168 Benchmark]: RCFGBuilder took 825.55 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 103.9 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-27 16:51:15,555 INFO L168 Benchmark]: TraceAbstraction took 102272.48 ms. Allocated memory was 202.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 103.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 16:51:15,558 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.18 ms. Allocated memory is still 139.5 MB. Free memory was 120.1 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.11 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 99.4 MB in the beginning and 155.5 MB in the end (delta: -56.1 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.54 ms. Allocated memory is still 202.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.56 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 825.55 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 103.9 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102272.48 ms. Allocated memory was 202.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 103.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 6463 VarBasedMoverChecksPositive, 266 VarBasedMoverChecksNegative, 94 SemBasedMoverChecksPositive, 257 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 66821 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L828] FCALL, FORK 0 pthread_create(&t928, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t929, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t930, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L769] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L770] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L771] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L772] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L773] 2 x$r_buff0_thd2 = (_Bool)1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L793] 3 y = 1 [L796] 3 z = 1 [L799] 3 __unbuffered_p2_EAX = z [L802] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L779] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L806] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L736] 1 a = 1 [L739] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L740] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L741] 1 x$flush_delayed = weak$$choice2 [L742] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L744] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L745] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L746] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L747] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L838] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L840] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L841] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 101.9s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 53.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4680 SDtfs, 9200 SDslu, 24391 SDs, 0 SdLazy, 29103 SolverSat, 779 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 746 GetRequests, 156 SyntacticMatches, 75 SemanticMatches, 515 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9655 ImplicationChecksByTransitivity, 15.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89098occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 208805 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 823 NumberOfCodeBlocks, 823 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 748 ConstructedInterpolants, 0 QuantifiedInterpolants, 166486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...