/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:28:51,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:28:51,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:28:51,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:28:51,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:28:51,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:28:51,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:28:51,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:28:51,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:28:51,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:28:51,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:28:51,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:28:51,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:28:51,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:28:51,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:28:51,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:28:51,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:28:51,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:28:51,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:28:51,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:28:51,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:28:51,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:28:51,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:28:51,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:28:51,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:28:51,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:28:51,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:28:51,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:28:51,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:28:51,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:28:51,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:28:51,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:28:51,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:28:51,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:28:51,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:28:51,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:28:51,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:28:51,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:28:51,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:28:51,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:28:51,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:28:51,237 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:28:51,268 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:28:51,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:28:51,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:28:51,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:28:51,273 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:28:51,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:28:51,277 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:28:51,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:28:51,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:28:51,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:28:51,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:28:51,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:28:51,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:28:51,278 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:28:51,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:28:51,279 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:28:51,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:28:51,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:28:51,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:28:51,279 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:28:51,279 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:28:51,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:28:51,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:28:51,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:28:51,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:28:51,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:28:51,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:28:51,283 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:28:51,283 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:28:51,284 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:28:51,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:28:51,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:28:51,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:28:51,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:28:51,587 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:28:51,588 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i [2019-12-27 06:28:51,652 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f84ec2b/c18e430959ab49df87c7265ff62d66b1/FLAGdb699de0b [2019-12-27 06:28:52,151 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:28:52,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i [2019-12-27 06:28:52,170 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f84ec2b/c18e430959ab49df87c7265ff62d66b1/FLAGdb699de0b [2019-12-27 06:28:52,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f84ec2b/c18e430959ab49df87c7265ff62d66b1 [2019-12-27 06:28:52,489 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:28:52,491 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:28:52,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:28:52,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:28:52,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:28:52,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:28:52" (1/1) ... [2019-12-27 06:28:52,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d9b7dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:52, skipping insertion in model container [2019-12-27 06:28:52,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:28:52" (1/1) ... [2019-12-27 06:28:52,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:28:52,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:28:53,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:28:53,200 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:28:53,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:28:53,362 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:28:53,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:53 WrapperNode [2019-12-27 06:28:53,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:28:53,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:28:53,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:28:53,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:28:53,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:53" (1/1) ... [2019-12-27 06:28:53,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:53" (1/1) ... [2019-12-27 06:28:53,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:28:53,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:28:53,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:28:53,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:28:53,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:53" (1/1) ... [2019-12-27 06:28:53,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:53" (1/1) ... [2019-12-27 06:28:53,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:53" (1/1) ... [2019-12-27 06:28:53,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:53" (1/1) ... [2019-12-27 06:28:53,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:53" (1/1) ... [2019-12-27 06:28:53,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:53" (1/1) ... [2019-12-27 06:28:53,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:53" (1/1) ... [2019-12-27 06:28:53,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:28:53,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:28:53,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:28:53,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:28:53,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:53" (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 06:28:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:28:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:28:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:28:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:28:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:28:53,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:28:53,575 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:28:53,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:28:53,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:28:53,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:28:53,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:28:53,577 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 06:28:54,273 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:28:54,274 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:28:54,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:28:54 BoogieIcfgContainer [2019-12-27 06:28:54,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:28:54,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:28:54,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:28:54,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:28:54,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:28:52" (1/3) ... [2019-12-27 06:28:54,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f104bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:28:54, skipping insertion in model container [2019-12-27 06:28:54,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:28:53" (2/3) ... [2019-12-27 06:28:54,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f104bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:28:54, skipping insertion in model container [2019-12-27 06:28:54,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:28:54" (3/3) ... [2019-12-27 06:28:54,289 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_pso.opt.i [2019-12-27 06:28:54,301 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:28:54,301 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:28:54,311 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:28:54,312 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:28:54,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,369 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,369 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,377 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,377 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,378 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,378 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,378 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,405 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,405 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:28:54,424 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 06:28:54,446 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:28:54,447 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:28:54,447 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:28:54,447 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:28:54,447 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:28:54,447 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:28:54,448 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:28:54,448 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:28:54,473 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 06:28:54,475 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 06:28:54,577 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 06:28:54,577 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:28:54,590 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:28:54,607 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 06:28:54,652 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 06:28:54,652 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:28:54,658 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:28:54,670 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 06:28:54,672 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:28:57,834 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 06:28:57,940 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 06:28:57,959 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48474 [2019-12-27 06:28:57,959 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 06:28:57,962 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 92 transitions [2019-12-27 06:28:58,484 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9180 states. [2019-12-27 06:28:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states. [2019-12-27 06:28:58,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 06:28:58,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:58,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 06:28:58,495 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:58,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:58,503 INFO L82 PathProgramCache]: Analyzing trace with hash 695759593, now seen corresponding path program 1 times [2019-12-27 06:28:58,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:58,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369895906] [2019-12-27 06:28:58,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:28:58,830 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 06:28:58,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369895906] [2019-12-27 06:28:58,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:28:58,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:28:58,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499285798] [2019-12-27 06:28:58,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:28:58,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:28:58,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:28:58,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:28:58,860 INFO L87 Difference]: Start difference. First operand 9180 states. Second operand 3 states. [2019-12-27 06:28:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:28:59,249 INFO L93 Difference]: Finished difference Result 9090 states and 29695 transitions. [2019-12-27 06:28:59,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:28:59,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 06:28:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:28:59,409 INFO L225 Difference]: With dead ends: 9090 [2019-12-27 06:28:59,409 INFO L226 Difference]: Without dead ends: 8908 [2019-12-27 06:28:59,415 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 06:28:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8908 states. [2019-12-27 06:28:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8908 to 8908. [2019-12-27 06:28:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8908 states. [2019-12-27 06:28:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8908 states to 8908 states and 29136 transitions. [2019-12-27 06:28:59,918 INFO L78 Accepts]: Start accepts. Automaton has 8908 states and 29136 transitions. Word has length 5 [2019-12-27 06:28:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:28:59,918 INFO L462 AbstractCegarLoop]: Abstraction has 8908 states and 29136 transitions. [2019-12-27 06:28:59,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:28:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 8908 states and 29136 transitions. [2019-12-27 06:28:59,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:28:59,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:28:59,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:28:59,925 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:28:59,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:28:59,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1035576107, now seen corresponding path program 1 times [2019-12-27 06:28:59,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:28:59,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432275548] [2019-12-27 06:28:59,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:28:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:00,149 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 06:29:00,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432275548] [2019-12-27 06:29:00,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:00,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:29:00,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725201378] [2019-12-27 06:29:00,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:29:00,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:00,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:29:00,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:29:00,154 INFO L87 Difference]: Start difference. First operand 8908 states and 29136 transitions. Second operand 4 states. [2019-12-27 06:29:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:00,762 INFO L93 Difference]: Finished difference Result 14155 states and 44019 transitions. [2019-12-27 06:29:00,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:29:00,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:29:00,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:00,849 INFO L225 Difference]: With dead ends: 14155 [2019-12-27 06:29:00,849 INFO L226 Difference]: Without dead ends: 14148 [2019-12-27 06:29:00,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 06:29:00,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14148 states. [2019-12-27 06:29:01,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14148 to 12754. [2019-12-27 06:29:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12754 states. [2019-12-27 06:29:01,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12754 states to 12754 states and 40283 transitions. [2019-12-27 06:29:01,425 INFO L78 Accepts]: Start accepts. Automaton has 12754 states and 40283 transitions. Word has length 11 [2019-12-27 06:29:01,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:01,426 INFO L462 AbstractCegarLoop]: Abstraction has 12754 states and 40283 transitions. [2019-12-27 06:29:01,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:29:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 12754 states and 40283 transitions. [2019-12-27 06:29:01,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:29:01,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:01,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:01,429 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:01,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:01,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1185448960, now seen corresponding path program 1 times [2019-12-27 06:29:01,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:01,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220890208] [2019-12-27 06:29:01,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:01,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220890208] [2019-12-27 06:29:01,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:01,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:29:01,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488362002] [2019-12-27 06:29:01,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:29:01,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:01,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:29:01,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:29:01,527 INFO L87 Difference]: Start difference. First operand 12754 states and 40283 transitions. Second operand 4 states. [2019-12-27 06:29:02,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:02,540 INFO L93 Difference]: Finished difference Result 15365 states and 48133 transitions. [2019-12-27 06:29:02,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:29:02,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:29:02,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:02,596 INFO L225 Difference]: With dead ends: 15365 [2019-12-27 06:29:02,596 INFO L226 Difference]: Without dead ends: 15365 [2019-12-27 06:29:02,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 06:29:02,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15365 states. [2019-12-27 06:29:03,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15365 to 13687. [2019-12-27 06:29:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13687 states. [2019-12-27 06:29:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13687 states to 13687 states and 43249 transitions. [2019-12-27 06:29:03,216 INFO L78 Accepts]: Start accepts. Automaton has 13687 states and 43249 transitions. Word has length 11 [2019-12-27 06:29:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:03,217 INFO L462 AbstractCegarLoop]: Abstraction has 13687 states and 43249 transitions. [2019-12-27 06:29:03,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:29:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 13687 states and 43249 transitions. [2019-12-27 06:29:03,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 06:29:03,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:03,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:03,222 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:03,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:03,222 INFO L82 PathProgramCache]: Analyzing trace with hash 832654764, now seen corresponding path program 1 times [2019-12-27 06:29:03,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:03,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986832466] [2019-12-27 06:29:03,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:03,294 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 06:29:03,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986832466] [2019-12-27 06:29:03,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:03,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:29:03,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085445940] [2019-12-27 06:29:03,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:29:03,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:03,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:29:03,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:29:03,299 INFO L87 Difference]: Start difference. First operand 13687 states and 43249 transitions. Second operand 5 states. [2019-12-27 06:29:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:03,783 INFO L93 Difference]: Finished difference Result 18440 states and 56874 transitions. [2019-12-27 06:29:03,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:29:03,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 06:29:03,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:03,854 INFO L225 Difference]: With dead ends: 18440 [2019-12-27 06:29:03,855 INFO L226 Difference]: Without dead ends: 18433 [2019-12-27 06:29:03,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:29:03,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18433 states. [2019-12-27 06:29:04,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18433 to 13597. [2019-12-27 06:29:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13597 states. [2019-12-27 06:29:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13597 states to 13597 states and 42837 transitions. [2019-12-27 06:29:04,512 INFO L78 Accepts]: Start accepts. Automaton has 13597 states and 42837 transitions. Word has length 17 [2019-12-27 06:29:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:04,512 INFO L462 AbstractCegarLoop]: Abstraction has 13597 states and 42837 transitions. [2019-12-27 06:29:04,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:29:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 13597 states and 42837 transitions. [2019-12-27 06:29:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:29:04,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:04,525 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 06:29:04,525 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:04,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:04,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1895943995, now seen corresponding path program 1 times [2019-12-27 06:29:04,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:04,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56520322] [2019-12-27 06:29:04,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:04,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56520322] [2019-12-27 06:29:04,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:04,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:29:04,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744500997] [2019-12-27 06:29:04,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:29:04,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:04,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:29:04,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:29:04,600 INFO L87 Difference]: Start difference. First operand 13597 states and 42837 transitions. Second operand 4 states. [2019-12-27 06:29:04,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:04,633 INFO L93 Difference]: Finished difference Result 2211 states and 5053 transitions. [2019-12-27 06:29:04,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:29:04,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:29:04,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:04,639 INFO L225 Difference]: With dead ends: 2211 [2019-12-27 06:29:04,639 INFO L226 Difference]: Without dead ends: 1925 [2019-12-27 06:29:04,640 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 06:29:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2019-12-27 06:29:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2019-12-27 06:29:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1925 states. [2019-12-27 06:29:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 4262 transitions. [2019-12-27 06:29:04,673 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 4262 transitions. Word has length 25 [2019-12-27 06:29:04,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:04,674 INFO L462 AbstractCegarLoop]: Abstraction has 1925 states and 4262 transitions. [2019-12-27 06:29:04,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:29:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 4262 transitions. [2019-12-27 06:29:04,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 06:29:04,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:04,679 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] [2019-12-27 06:29:04,680 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:04,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:04,680 INFO L82 PathProgramCache]: Analyzing trace with hash 228789501, now seen corresponding path program 1 times [2019-12-27 06:29:04,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:04,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914765485] [2019-12-27 06:29:04,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:04,809 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 06:29:04,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914765485] [2019-12-27 06:29:04,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:04,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:29:04,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39561854] [2019-12-27 06:29:04,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:29:04,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:04,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:29:04,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:29:04,813 INFO L87 Difference]: Start difference. First operand 1925 states and 4262 transitions. Second operand 5 states. [2019-12-27 06:29:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:04,853 INFO L93 Difference]: Finished difference Result 421 states and 770 transitions. [2019-12-27 06:29:04,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:29:04,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 06:29:04,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:04,855 INFO L225 Difference]: With dead ends: 421 [2019-12-27 06:29:04,855 INFO L226 Difference]: Without dead ends: 375 [2019-12-27 06:29:04,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:29:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-12-27 06:29:04,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 340. [2019-12-27 06:29:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-27 06:29:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 615 transitions. [2019-12-27 06:29:04,862 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 615 transitions. Word has length 37 [2019-12-27 06:29:04,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:04,863 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 615 transitions. [2019-12-27 06:29:04,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:29:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 615 transitions. [2019-12-27 06:29:04,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:29:04,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:04,867 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] [2019-12-27 06:29:04,867 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:04,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:04,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1711535056, now seen corresponding path program 1 times [2019-12-27 06:29:04,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:04,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354838207] [2019-12-27 06:29:04,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:04,973 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 06:29:04,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354838207] [2019-12-27 06:29:04,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:04,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:29:04,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261758410] [2019-12-27 06:29:04,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:29:04,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:04,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:29:04,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:04,977 INFO L87 Difference]: Start difference. First operand 340 states and 615 transitions. Second operand 3 states. [2019-12-27 06:29:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:05,030 INFO L93 Difference]: Finished difference Result 354 states and 634 transitions. [2019-12-27 06:29:05,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:29:05,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:29:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:05,035 INFO L225 Difference]: With dead ends: 354 [2019-12-27 06:29:05,035 INFO L226 Difference]: Without dead ends: 354 [2019-12-27 06:29:05,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:05,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-12-27 06:29:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350. [2019-12-27 06:29:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-27 06:29:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 630 transitions. [2019-12-27 06:29:05,045 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 630 transitions. Word has length 52 [2019-12-27 06:29:05,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:05,046 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 630 transitions. [2019-12-27 06:29:05,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:29:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 630 transitions. [2019-12-27 06:29:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:29:05,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:05,048 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] [2019-12-27 06:29:05,048 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:05,049 INFO L82 PathProgramCache]: Analyzing trace with hash 2008413200, now seen corresponding path program 1 times [2019-12-27 06:29:05,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:05,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007776624] [2019-12-27 06:29:05,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:05,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007776624] [2019-12-27 06:29:05,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:05,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:29:05,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068264014] [2019-12-27 06:29:05,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:29:05,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:05,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:29:05,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:05,117 INFO L87 Difference]: Start difference. First operand 350 states and 630 transitions. Second operand 3 states. [2019-12-27 06:29:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:05,132 INFO L93 Difference]: Finished difference Result 350 states and 617 transitions. [2019-12-27 06:29:05,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:29:05,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:29:05,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:05,134 INFO L225 Difference]: With dead ends: 350 [2019-12-27 06:29:05,134 INFO L226 Difference]: Without dead ends: 350 [2019-12-27 06:29:05,135 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 06:29:05,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-12-27 06:29:05,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2019-12-27 06:29:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-27 06:29:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 617 transitions. [2019-12-27 06:29:05,142 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 617 transitions. Word has length 52 [2019-12-27 06:29:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:05,142 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 617 transitions. [2019-12-27 06:29:05,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:29:05,143 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 617 transitions. [2019-12-27 06:29:05,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:29:05,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:05,144 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] [2019-12-27 06:29:05,145 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:05,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:05,145 INFO L82 PathProgramCache]: Analyzing trace with hash -440282734, now seen corresponding path program 1 times [2019-12-27 06:29:05,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:05,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343796224] [2019-12-27 06:29:05,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:05,335 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 06:29:05,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343796224] [2019-12-27 06:29:05,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:05,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:29:05,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165456385] [2019-12-27 06:29:05,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:29:05,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:05,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:29:05,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:29:05,338 INFO L87 Difference]: Start difference. First operand 350 states and 617 transitions. Second operand 8 states. [2019-12-27 06:29:05,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:05,773 INFO L93 Difference]: Finished difference Result 541 states and 948 transitions. [2019-12-27 06:29:05,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:29:05,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-27 06:29:05,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:05,775 INFO L225 Difference]: With dead ends: 541 [2019-12-27 06:29:05,775 INFO L226 Difference]: Without dead ends: 541 [2019-12-27 06:29:05,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:29:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-12-27 06:29:05,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 438. [2019-12-27 06:29:05,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-27 06:29:05,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 772 transitions. [2019-12-27 06:29:05,783 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 772 transitions. Word has length 53 [2019-12-27 06:29:05,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:05,784 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 772 transitions. [2019-12-27 06:29:05,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:29:05,784 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 772 transitions. [2019-12-27 06:29:05,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:29:05,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:05,785 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] [2019-12-27 06:29:05,786 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:05,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:05,786 INFO L82 PathProgramCache]: Analyzing trace with hash 783878168, now seen corresponding path program 2 times [2019-12-27 06:29:05,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:05,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994649853] [2019-12-27 06:29:05,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:05,850 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 06:29:05,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994649853] [2019-12-27 06:29:05,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:05,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:29:05,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767031404] [2019-12-27 06:29:05,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:29:05,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:05,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:29:05,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:05,853 INFO L87 Difference]: Start difference. First operand 438 states and 772 transitions. Second operand 3 states. [2019-12-27 06:29:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:05,898 INFO L93 Difference]: Finished difference Result 437 states and 770 transitions. [2019-12-27 06:29:05,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:29:05,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 06:29:05,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:05,900 INFO L225 Difference]: With dead ends: 437 [2019-12-27 06:29:05,900 INFO L226 Difference]: Without dead ends: 437 [2019-12-27 06:29:05,900 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 06:29:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-27 06:29:05,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 349. [2019-12-27 06:29:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-12-27 06:29:05,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 606 transitions. [2019-12-27 06:29:05,906 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 606 transitions. Word has length 53 [2019-12-27 06:29:05,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:05,906 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 606 transitions. [2019-12-27 06:29:05,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:29:05,907 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 606 transitions. [2019-12-27 06:29:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:29:05,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:05,908 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] [2019-12-27 06:29:05,908 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:05,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:05,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1094441083, now seen corresponding path program 1 times [2019-12-27 06:29:05,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:05,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737051612] [2019-12-27 06:29:05,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:06,250 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 06:29:06,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737051612] [2019-12-27 06:29:06,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:06,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:29:06,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824038027] [2019-12-27 06:29:06,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:29:06,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:06,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:29:06,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:29:06,252 INFO L87 Difference]: Start difference. First operand 349 states and 606 transitions. Second operand 13 states. [2019-12-27 06:29:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:06,911 INFO L93 Difference]: Finished difference Result 684 states and 1207 transitions. [2019-12-27 06:29:06,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 06:29:06,911 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 06:29:06,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:06,912 INFO L225 Difference]: With dead ends: 684 [2019-12-27 06:29:06,912 INFO L226 Difference]: Without dead ends: 296 [2019-12-27 06:29:06,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-12-27 06:29:06,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-27 06:29:06,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 267. [2019-12-27 06:29:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-12-27 06:29:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 457 transitions. [2019-12-27 06:29:06,918 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 457 transitions. Word has length 54 [2019-12-27 06:29:06,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:06,918 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 457 transitions. [2019-12-27 06:29:06,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:29:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 457 transitions. [2019-12-27 06:29:06,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:29:06,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:06,919 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] [2019-12-27 06:29:06,920 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:06,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:06,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1737208453, now seen corresponding path program 2 times [2019-12-27 06:29:06,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:06,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268046253] [2019-12-27 06:29:06,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:07,091 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 06:29:07,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268046253] [2019-12-27 06:29:07,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:07,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:29:07,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286512860] [2019-12-27 06:29:07,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:29:07,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:07,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:29:07,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:29:07,093 INFO L87 Difference]: Start difference. First operand 267 states and 457 transitions. Second operand 10 states. [2019-12-27 06:29:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:07,326 INFO L93 Difference]: Finished difference Result 385 states and 639 transitions. [2019-12-27 06:29:07,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:29:07,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 06:29:07,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:07,327 INFO L225 Difference]: With dead ends: 385 [2019-12-27 06:29:07,327 INFO L226 Difference]: Without dead ends: 222 [2019-12-27 06:29:07,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-27 06:29:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-27 06:29:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2019-12-27 06:29:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-27 06:29:07,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 341 transitions. [2019-12-27 06:29:07,332 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 341 transitions. Word has length 54 [2019-12-27 06:29:07,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:07,332 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 341 transitions. [2019-12-27 06:29:07,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:29:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 341 transitions. [2019-12-27 06:29:07,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:29:07,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:07,333 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] [2019-12-27 06:29:07,334 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:07,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:07,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1606647941, now seen corresponding path program 3 times [2019-12-27 06:29:07,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:07,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521706122] [2019-12-27 06:29:07,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:29:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:29:07,515 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:29:07,515 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:29:07,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_44| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_19 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd2~0_17 0) (= v_~x$w_buff1_used~0_63 0) (= 0 v_~x$r_buff0_thd2~0_26) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1095~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1095~0.base_20|) |v_ULTIMATE.start_main_~#t1095~0.offset_15| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~x$w_buff1~0_23) (= 0 v_~x$r_buff0_thd1~0_20) (= v_~x~0_28 0) (= |v_ULTIMATE.start_main_~#t1095~0.offset_15| 0) (= v_~x$flush_delayed~0_16 0) (= 0 v_~x$r_buff0_thd0~0_78) (= (store .cse0 |v_ULTIMATE.start_main_~#t1095~0.base_20| 1) |v_#valid_42|) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1095~0.base_20|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1095~0.base_20| 4) |v_#length_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1095~0.base_20|) (= |v_#NULL.offset_5| 0) (= 0 v_~y~0_8) (= 0 v_~x$w_buff0_used~0_105) (= 0 v_~z~0_9) (= v_~x$mem_tmp~0_11 0) (= v_~x$r_buff1_thd0~0_45 0) (= 0 v_~weak$$choice0~0_6) (= v_~main$tmp_guard0~0_11 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_10 0) (= 0 v_~x$w_buff0~0_28))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_~#t1096~0.offset=|v_ULTIMATE.start_main_~#t1096~0.offset_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ULTIMATE.start_main_~#t1096~0.base=|v_ULTIMATE.start_main_~#t1096~0.base_17|, #length=|v_#length_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ~x$w_buff1~0=v_~x$w_buff1~0_23, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~x~0=v_~x~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_12|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ULTIMATE.start_main_~#t1095~0.offset=|v_ULTIMATE.start_main_~#t1095~0.offset_15|, ~y~0=v_~y~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_12|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_45, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_31, ULTIMATE.start_main_~#t1095~0.base=|v_ULTIMATE.start_main_~#t1095~0.base_20|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1096~0.offset, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1096~0.base, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1095~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1095~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 06:29:07,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L789-1-->L791: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1096~0.base_11|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1096~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1096~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1096~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1096~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1096~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1096~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1096~0.base_11|) |v_ULTIMATE.start_main_~#t1096~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1096~0.base=|v_ULTIMATE.start_main_~#t1096~0.base_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1096~0.offset=|v_ULTIMATE.start_main_~#t1096~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1096~0.base, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1096~0.offset] because there is no mapped edge [2019-12-27 06:29:07,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_43 v_~x$w_buff0_used~0_72) (= (mod v_~x$w_buff1_used~0_43 256) 0) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= 2 v_~x$w_buff0~0_15) (= v_~x$w_buff0~0_16 v_~x$w_buff1~0_13) (= 1 v_~x$w_buff0_used~0_71) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} 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 06:29:07,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L732-2-->L732-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In1111653106 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1111653106 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out1111653106| |P0Thread1of1ForFork0_#t~ite4_Out1111653106|))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out1111653106| ~x$w_buff1~0_In1111653106) (not .cse1) .cse2) (and (= |P0Thread1of1ForFork0_#t~ite3_Out1111653106| ~x~0_In1111653106) (or .cse0 .cse1) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1111653106, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1111653106, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1111653106, ~x~0=~x~0_In1111653106} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1111653106|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1111653106|, ~x$w_buff1~0=~x$w_buff1~0_In1111653106, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1111653106, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1111653106, ~x~0=~x~0_In1111653106} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 06:29:07,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1136888336 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1136888336 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1136888336|)) (and (= ~x$w_buff0_used~0_In1136888336 |P0Thread1of1ForFork0_#t~ite5_Out1136888336|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1136888336, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1136888336} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1136888336|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1136888336, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1136888336} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:29:07,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L734-->L734-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In102508937 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In102508937 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In102508937 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In102508937 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out102508937|)) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In102508937 |P0Thread1of1ForFork0_#t~ite6_Out102508937|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In102508937, ~x$w_buff1_used~0=~x$w_buff1_used~0_In102508937, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In102508937, ~x$w_buff0_used~0=~x$w_buff0_used~0_In102508937} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out102508937|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In102508937, ~x$w_buff1_used~0=~x$w_buff1_used~0_In102508937, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In102508937, ~x$w_buff0_used~0=~x$w_buff0_used~0_In102508937} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:29:07,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L735-->L735-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1836199130 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1836199130 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1836199130| ~x$r_buff0_thd1~0_In1836199130)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out1836199130| 0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1836199130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1836199130} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1836199130, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1836199130|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1836199130} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 06:29:07,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L736-->L736-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1719689043 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1719689043 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1719689043 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1719689043 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1719689043|)) (and (= ~x$r_buff1_thd1~0_In1719689043 |P0Thread1of1ForFork0_#t~ite8_Out1719689043|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1719689043, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1719689043, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1719689043, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1719689043} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1719689043, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1719689043|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1719689043, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1719689043, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1719689043} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:29:07,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L736-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 06:29:07,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1279484901 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1279484901 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1279484901|) (not .cse1)) (and (= ~x$w_buff0_used~0_In1279484901 |P1Thread1of1ForFork1_#t~ite11_Out1279484901|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1279484901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1279484901} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1279484901|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1279484901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1279484901} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 06:29:07,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-576440359 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-576440359 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-576440359 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-576440359 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite12_Out-576440359| ~x$w_buff1_used~0_In-576440359)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-576440359| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-576440359, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-576440359, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-576440359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-576440359} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-576440359, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-576440359, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-576440359|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-576440359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-576440359} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:29:07,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L769-->L770: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In2053519345 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2053519345 256)))) (or (and (= 0 ~x$r_buff0_thd2~0_Out2053519345) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In2053519345 ~x$r_buff0_thd2~0_Out2053519345)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2053519345, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2053519345} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out2053519345|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2053519345, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2053519345} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 06:29:07,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1787941406 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1787941406 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1787941406 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1787941406 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1787941406| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite14_Out1787941406| ~x$r_buff1_thd2~0_In1787941406) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1787941406, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1787941406, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1787941406, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1787941406} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1787941406, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1787941406, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1787941406, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1787941406|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1787941406} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:29:07,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L770-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:29:07,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_93 256)) (= 0 (mod v_~x$r_buff0_thd0~0_66 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_66, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_66, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:29:07,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In766616286 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In766616286 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In766616286 |ULTIMATE.start_main_#t~ite17_Out766616286|)) (and (= ~x~0_In766616286 |ULTIMATE.start_main_#t~ite17_Out766616286|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In766616286, ~x$w_buff1_used~0=~x$w_buff1_used~0_In766616286, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In766616286, ~x~0=~x~0_In766616286} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out766616286|, ~x$w_buff1~0=~x$w_buff1~0_In766616286, ~x$w_buff1_used~0=~x$w_buff1_used~0_In766616286, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In766616286, ~x~0=~x~0_In766616286} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 06:29:07,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L797-4-->L798: Formula: (= v_~x~0_19 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-27 06:29:07,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In672512459 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In672512459 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out672512459| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In672512459 |ULTIMATE.start_main_#t~ite19_Out672512459|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In672512459, ~x$w_buff0_used~0=~x$w_buff0_used~0_In672512459} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In672512459, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out672512459|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In672512459} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:29:07,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In325522390 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In325522390 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In325522390 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In325522390 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out325522390| ~x$w_buff1_used~0_In325522390) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite20_Out325522390| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In325522390, ~x$w_buff1_used~0=~x$w_buff1_used~0_In325522390, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In325522390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In325522390} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In325522390, ~x$w_buff1_used~0=~x$w_buff1_used~0_In325522390, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out325522390|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In325522390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In325522390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:29:07,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1985500771 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1985500771 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out-1985500771| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1985500771| ~x$r_buff0_thd0~0_In-1985500771)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1985500771, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1985500771} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1985500771, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1985500771|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1985500771} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:29:07,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In2083803897 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In2083803897 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2083803897 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2083803897 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In2083803897 |ULTIMATE.start_main_#t~ite22_Out2083803897|)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out2083803897|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2083803897, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2083803897, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2083803897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2083803897} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2083803897, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2083803897, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2083803897, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out2083803897|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2083803897} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:29:07,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-34551136 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite32_Out-34551136| ~x$w_buff1~0_In-34551136) (= |ULTIMATE.start_main_#t~ite31_In-34551136| |ULTIMATE.start_main_#t~ite31_Out-34551136|)) (and (= |ULTIMATE.start_main_#t~ite31_Out-34551136| ~x$w_buff1~0_In-34551136) (= |ULTIMATE.start_main_#t~ite32_Out-34551136| |ULTIMATE.start_main_#t~ite31_Out-34551136|) (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-34551136 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-34551136 256))) (= 0 (mod ~x$w_buff0_used~0_In-34551136 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-34551136 256))))) .cse0))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-34551136, ~x$w_buff1~0=~x$w_buff1~0_In-34551136, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-34551136, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-34551136, ~weak$$choice2~0=~weak$$choice2~0_In-34551136, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-34551136|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-34551136} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-34551136, ~x$w_buff1~0=~x$w_buff1~0_In-34551136, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-34551136, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-34551136|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-34551136, ~weak$$choice2~0=~weak$$choice2~0_In-34551136, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-34551136|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-34551136} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 06:29:07,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L812-->L812-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1135454140 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out1135454140| |ULTIMATE.start_main_#t~ite38_Out1135454140|) (= ~x$w_buff1_used~0_In1135454140 |ULTIMATE.start_main_#t~ite37_Out1135454140|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1135454140 256)))) (or (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In1135454140 256))) (and (= 0 (mod ~x$r_buff1_thd0~0_In1135454140 256)) .cse0) (= (mod ~x$w_buff0_used~0_In1135454140 256) 0))) .cse1) (and (= |ULTIMATE.start_main_#t~ite37_In1135454140| |ULTIMATE.start_main_#t~ite37_Out1135454140|) (not .cse1) (= ~x$w_buff1_used~0_In1135454140 |ULTIMATE.start_main_#t~ite38_Out1135454140|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1135454140, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1135454140, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In1135454140|, ~weak$$choice2~0=~weak$$choice2~0_In1135454140, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1135454140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135454140} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1135454140, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1135454140, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1135454140|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1135454140|, ~weak$$choice2~0=~weak$$choice2~0_In1135454140, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1135454140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135454140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 06:29:07,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [602] [602] L813-->L814: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~x$r_buff0_thd0~0_53 v_~x$r_buff0_thd0~0_52)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_6|, ~weak$$choice2~0=v_~weak$$choice2~0_18} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:29:07,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L816-->L819-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$mem_tmp~0_6 v_~x~0_23) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:29:07,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:29:07,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:29:07 BasicIcfg [2019-12-27 06:29:07,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:29:07,677 INFO L168 Benchmark]: Toolchain (without parser) took 15185.20 ms. Allocated memory was 144.2 MB in the beginning and 703.1 MB in the end (delta: 558.9 MB). Free memory was 99.2 MB in the beginning and 343.9 MB in the end (delta: -244.7 MB). Peak memory consumption was 314.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:29:07,677 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 06:29:07,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 871.32 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.0 MB in the beginning and 155.8 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:29:07,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.38 ms. Allocated memory is still 201.3 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:29:07,683 INFO L168 Benchmark]: Boogie Preprocessor took 43.61 ms. Allocated memory is still 201.3 MB. Free memory was 152.4 MB in the beginning and 150.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:29:07,684 INFO L168 Benchmark]: RCFGBuilder took 792.07 ms. Allocated memory is still 201.3 MB. Free memory was 150.3 MB in the beginning and 105.1 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:29:07,687 INFO L168 Benchmark]: TraceAbstraction took 13396.23 ms. Allocated memory was 201.3 MB in the beginning and 703.1 MB in the end (delta: 501.7 MB). Free memory was 105.1 MB in the beginning and 343.9 MB in the end (delta: -238.8 MB). Peak memory consumption was 263.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:29:07,694 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.19 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 871.32 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.0 MB in the beginning and 155.8 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.38 ms. Allocated memory is still 201.3 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.61 ms. Allocated memory is still 201.3 MB. Free memory was 152.4 MB in the beginning and 150.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 792.07 ms. Allocated memory is still 201.3 MB. Free memory was 150.3 MB in the beginning and 105.1 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13396.23 ms. Allocated memory was 201.3 MB in the beginning and 703.1 MB in the end (delta: 501.7 MB). Free memory was 105.1 MB in the beginning and 343.9 MB in the end (delta: -238.8 MB). Peak memory consumption was 263.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 148 ProgramPointsBefore, 80 ProgramPointsAfterwards, 182 TransitionsBefore, 92 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 25 ChoiceCompositions, 3580 VarBasedMoverChecksPositive, 150 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48474 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1095, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L791] FCALL, FORK 0 pthread_create(&t1096, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L766] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L766] 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) [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 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 [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1307 SDtfs, 1386 SDslu, 2605 SDs, 0 SdLazy, 1395 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13687occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 8191 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 412 ConstructedInterpolants, 0 QuantifiedInterpolants, 75419 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...