/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:06:03,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:06:03,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:06:03,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:06:03,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:06:03,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:06:03,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:06:03,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:06:03,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:06:03,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:06:03,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:06:03,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:06:03,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:06:03,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:06:03,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:06:03,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:06:03,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:06:03,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:06:03,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:06:03,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:06:03,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:06:03,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:06:03,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:06:03,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:06:03,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:06:03,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:06:03,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:06:03,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:06:03,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:06:03,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:06:03,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:06:03,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:06:03,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:06:03,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:06:03,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:06:03,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:06:03,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:06:03,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:06:03,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:06:03,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:06:03,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:06:03,099 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:06:03,132 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:06:03,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:06:03,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:06:03,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:06:03,137 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:06:03,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:06:03,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:06:03,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:06:03,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:06:03,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:06:03,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:06:03,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:06:03,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:06:03,139 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:06:03,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:06:03,140 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:06:03,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:06:03,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:06:03,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:06:03,140 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:06:03,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:06:03,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:06:03,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:06:03,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:06:03,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:06:03,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:06:03,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:06:03,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:06:03,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:06:03,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:06:03,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:06:03,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:06:03,501 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:06:03,502 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:06:03,503 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2019-12-27 03:06:03,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6f7dadf/25a6244add194083b0951f527e2e02e3/FLAG230f1a405 [2019-12-27 03:06:04,132 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:06:04,133 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2019-12-27 03:06:04,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6f7dadf/25a6244add194083b0951f527e2e02e3/FLAG230f1a405 [2019-12-27 03:06:04,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6f7dadf/25a6244add194083b0951f527e2e02e3 [2019-12-27 03:06:04,443 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:06:04,445 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:06:04,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:06:04,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:06:04,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:06:04,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:06:04" (1/1) ... [2019-12-27 03:06:04,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cad934d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:04, skipping insertion in model container [2019-12-27 03:06:04,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:06:04" (1/1) ... [2019-12-27 03:06:04,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:06:04,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:06:05,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:06:05,082 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:06:05,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:06:05,255 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:06:05,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:05 WrapperNode [2019-12-27 03:06:05,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:06:05,256 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:06:05,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:06:05,257 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:06:05,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:05" (1/1) ... [2019-12-27 03:06:05,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:05" (1/1) ... [2019-12-27 03:06:05,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:06:05,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:06:05,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:06:05,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:06:05,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:05" (1/1) ... [2019-12-27 03:06:05,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:05" (1/1) ... [2019-12-27 03:06:05,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:05" (1/1) ... [2019-12-27 03:06:05,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:05" (1/1) ... [2019-12-27 03:06:05,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:05" (1/1) ... [2019-12-27 03:06:05,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:05" (1/1) ... [2019-12-27 03:06:05,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:05" (1/1) ... [2019-12-27 03:06:05,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:06:05,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:06:05,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:06:05,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:06:05,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:06:05,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:06:05,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:06:05,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:06:05,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:06:05,447 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:06:05,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:06:05,448 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:06:05,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:06:05,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:06:05,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:06:05,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:06:05,451 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 03:06:06,275 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:06:06,276 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:06:06,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:06:06 BoogieIcfgContainer [2019-12-27 03:06:06,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:06:06,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:06:06,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:06:06,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:06:06,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:06:04" (1/3) ... [2019-12-27 03:06:06,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3dfdf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:06:06, skipping insertion in model container [2019-12-27 03:06:06,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:05" (2/3) ... [2019-12-27 03:06:06,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3dfdf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:06:06, skipping insertion in model container [2019-12-27 03:06:06,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:06:06" (3/3) ... [2019-12-27 03:06:06,287 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i [2019-12-27 03:06:06,297 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:06:06,297 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:06:06,305 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:06:06,306 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:06:06,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,351 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,353 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,366 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,366 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,370 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:06,389 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:06:06,412 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:06:06,413 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:06:06,413 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:06:06,414 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:06:06,414 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:06:06,414 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:06:06,414 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:06:06,415 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:06:06,440 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 03:06:06,442 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 03:06:06,549 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 03:06:06,550 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:06:06,570 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:06:06,589 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 03:06:06,679 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 03:06:06,679 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:06:06,687 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:06:06,703 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 03:06:06,709 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:06:11,122 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 03:06:11,247 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 03:06:11,283 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50487 [2019-12-27 03:06:11,284 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 03:06:11,288 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-27 03:06:11,873 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9480 states. [2019-12-27 03:06:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 9480 states. [2019-12-27 03:06:11,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:06:11,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:11,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:06:11,883 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:11,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:11,890 INFO L82 PathProgramCache]: Analyzing trace with hash 692929394, now seen corresponding path program 1 times [2019-12-27 03:06:11,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:11,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080130657] [2019-12-27 03:06:11,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:12,105 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 03:06:12,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080130657] [2019-12-27 03:06:12,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:12,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:06:12,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538934620] [2019-12-27 03:06:12,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:06:12,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:12,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:06:12,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:06:12,131 INFO L87 Difference]: Start difference. First operand 9480 states. Second operand 3 states. [2019-12-27 03:06:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:12,472 INFO L93 Difference]: Finished difference Result 9416 states and 31128 transitions. [2019-12-27 03:06:12,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:06:12,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:06:12,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:12,619 INFO L225 Difference]: With dead ends: 9416 [2019-12-27 03:06:12,619 INFO L226 Difference]: Without dead ends: 9234 [2019-12-27 03:06:12,620 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 03:06:12,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9234 states. [2019-12-27 03:06:13,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9234 to 9234. [2019-12-27 03:06:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-27 03:06:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 30568 transitions. [2019-12-27 03:06:13,635 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 30568 transitions. Word has length 5 [2019-12-27 03:06:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:13,635 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 30568 transitions. [2019-12-27 03:06:13,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:06:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 30568 transitions. [2019-12-27 03:06:13,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:06:13,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:13,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:13,639 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:13,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:13,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1820083367, now seen corresponding path program 1 times [2019-12-27 03:06:13,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:13,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54152290] [2019-12-27 03:06:13,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:13,795 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 03:06:13,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54152290] [2019-12-27 03:06:13,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:13,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:06:13,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316394108] [2019-12-27 03:06:13,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:06:13,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:13,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:06:13,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:06:13,801 INFO L87 Difference]: Start difference. First operand 9234 states and 30568 transitions. Second operand 4 states. [2019-12-27 03:06:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:14,293 INFO L93 Difference]: Finished difference Result 14362 states and 45554 transitions. [2019-12-27 03:06:14,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:06:14,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:06:14,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:14,389 INFO L225 Difference]: With dead ends: 14362 [2019-12-27 03:06:14,390 INFO L226 Difference]: Without dead ends: 14355 [2019-12-27 03:06:14,391 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 03:06:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14355 states. [2019-12-27 03:06:15,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14355 to 13038. [2019-12-27 03:06:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13038 states. [2019-12-27 03:06:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 41962 transitions. [2019-12-27 03:06:15,079 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 41962 transitions. Word has length 11 [2019-12-27 03:06:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:15,079 INFO L462 AbstractCegarLoop]: Abstraction has 13038 states and 41962 transitions. [2019-12-27 03:06:15,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:06:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 41962 transitions. [2019-12-27 03:06:15,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:06:15,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:15,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:15,092 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:15,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:15,093 INFO L82 PathProgramCache]: Analyzing trace with hash 417951775, now seen corresponding path program 1 times [2019-12-27 03:06:15,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:15,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819442332] [2019-12-27 03:06:15,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:15,171 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 03:06:15,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819442332] [2019-12-27 03:06:15,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:15,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:06:15,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102900626] [2019-12-27 03:06:15,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:06:15,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:15,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:06:15,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:06:15,174 INFO L87 Difference]: Start difference. First operand 13038 states and 41962 transitions. Second operand 3 states. [2019-12-27 03:06:15,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:15,195 INFO L93 Difference]: Finished difference Result 1778 states and 4038 transitions. [2019-12-27 03:06:15,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:06:15,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 03:06:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:15,201 INFO L225 Difference]: With dead ends: 1778 [2019-12-27 03:06:15,201 INFO L226 Difference]: Without dead ends: 1778 [2019-12-27 03:06:15,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:06:15,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2019-12-27 03:06:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1778. [2019-12-27 03:06:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2019-12-27 03:06:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4038 transitions. [2019-12-27 03:06:15,255 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4038 transitions. Word has length 11 [2019-12-27 03:06:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:15,255 INFO L462 AbstractCegarLoop]: Abstraction has 1778 states and 4038 transitions. [2019-12-27 03:06:15,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:06:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4038 transitions. [2019-12-27 03:06:15,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 03:06:15,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:15,258 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] [2019-12-27 03:06:15,258 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:15,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:15,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1954901459, now seen corresponding path program 1 times [2019-12-27 03:06:15,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:15,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134180933] [2019-12-27 03:06:15,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:15,397 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 03:06:15,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134180933] [2019-12-27 03:06:15,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:15,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:06:15,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022908169] [2019-12-27 03:06:15,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:06:15,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:15,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:06:15,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:06:15,405 INFO L87 Difference]: Start difference. First operand 1778 states and 4038 transitions. Second operand 4 states. [2019-12-27 03:06:15,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:15,426 INFO L93 Difference]: Finished difference Result 371 states and 689 transitions. [2019-12-27 03:06:15,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:06:15,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 03:06:15,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:15,428 INFO L225 Difference]: With dead ends: 371 [2019-12-27 03:06:15,428 INFO L226 Difference]: Without dead ends: 371 [2019-12-27 03:06:15,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:06:15,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-27 03:06:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 336. [2019-12-27 03:06:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-27 03:06:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 624 transitions. [2019-12-27 03:06:15,438 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 624 transitions. Word has length 23 [2019-12-27 03:06:15,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:15,438 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 624 transitions. [2019-12-27 03:06:15,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:06:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 624 transitions. [2019-12-27 03:06:15,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:06:15,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:15,440 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 03:06:15,441 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:15,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:15,441 INFO L82 PathProgramCache]: Analyzing trace with hash 798988436, now seen corresponding path program 1 times [2019-12-27 03:06:15,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:15,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887686766] [2019-12-27 03:06:15,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:15,569 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 03:06:15,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887686766] [2019-12-27 03:06:15,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:15,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:06:15,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067919169] [2019-12-27 03:06:15,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:06:15,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:15,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:06:15,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:06:15,572 INFO L87 Difference]: Start difference. First operand 336 states and 624 transitions. Second operand 3 states. [2019-12-27 03:06:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:15,625 INFO L93 Difference]: Finished difference Result 345 states and 638 transitions. [2019-12-27 03:06:15,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:06:15,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 03:06:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:15,627 INFO L225 Difference]: With dead ends: 345 [2019-12-27 03:06:15,628 INFO L226 Difference]: Without dead ends: 345 [2019-12-27 03:06:15,628 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 03:06:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-27 03:06:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-27 03:06:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-27 03:06:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 634 transitions. [2019-12-27 03:06:15,636 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 634 transitions. Word has length 52 [2019-12-27 03:06:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:15,637 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 634 transitions. [2019-12-27 03:06:15,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:06:15,637 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 634 transitions. [2019-12-27 03:06:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:06:15,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:15,639 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 03:06:15,639 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:15,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:15,640 INFO L82 PathProgramCache]: Analyzing trace with hash 112676449, now seen corresponding path program 1 times [2019-12-27 03:06:15,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:15,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678679035] [2019-12-27 03:06:15,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:15,701 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 03:06:15,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678679035] [2019-12-27 03:06:15,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:15,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:06:15,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4815337] [2019-12-27 03:06:15,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:06:15,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:15,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:06:15,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:06:15,704 INFO L87 Difference]: Start difference. First operand 341 states and 634 transitions. Second operand 3 states. [2019-12-27 03:06:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:15,749 INFO L93 Difference]: Finished difference Result 345 states and 628 transitions. [2019-12-27 03:06:15,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:06:15,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 03:06:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:15,750 INFO L225 Difference]: With dead ends: 345 [2019-12-27 03:06:15,751 INFO L226 Difference]: Without dead ends: 345 [2019-12-27 03:06:15,751 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 03:06:15,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-27 03:06:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-27 03:06:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-27 03:06:15,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 624 transitions. [2019-12-27 03:06:15,758 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 624 transitions. Word has length 52 [2019-12-27 03:06:15,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:15,759 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 624 transitions. [2019-12-27 03:06:15,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:06:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 624 transitions. [2019-12-27 03:06:15,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:06:15,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:15,761 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 03:06:15,761 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:15,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:15,761 INFO L82 PathProgramCache]: Analyzing trace with hash 107384222, now seen corresponding path program 1 times [2019-12-27 03:06:15,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:15,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369260765] [2019-12-27 03:06:15,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:15,876 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 03:06:15,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369260765] [2019-12-27 03:06:15,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:15,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:06:15,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700204795] [2019-12-27 03:06:15,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:06:15,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:15,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:06:15,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:06:15,879 INFO L87 Difference]: Start difference. First operand 341 states and 624 transitions. Second operand 3 states. [2019-12-27 03:06:15,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:15,928 INFO L93 Difference]: Finished difference Result 340 states and 622 transitions. [2019-12-27 03:06:15,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:06:15,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 03:06:15,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:15,930 INFO L225 Difference]: With dead ends: 340 [2019-12-27 03:06:15,930 INFO L226 Difference]: Without dead ends: 340 [2019-12-27 03:06:15,931 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 03:06:15,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-12-27 03:06:15,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2019-12-27 03:06:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-12-27 03:06:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 528 transitions. [2019-12-27 03:06:15,942 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 528 transitions. Word has length 52 [2019-12-27 03:06:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:15,942 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 528 transitions. [2019-12-27 03:06:15,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:06:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 528 transitions. [2019-12-27 03:06:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:06:15,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:15,944 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 03:06:15,945 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:15,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:15,945 INFO L82 PathProgramCache]: Analyzing trace with hash -638350665, now seen corresponding path program 1 times [2019-12-27 03:06:15,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:15,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665881256] [2019-12-27 03:06:15,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:16,101 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 03:06:16,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665881256] [2019-12-27 03:06:16,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:16,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:06:16,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163763172] [2019-12-27 03:06:16,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:06:16,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:16,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:06:16,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:06:16,106 INFO L87 Difference]: Start difference. First operand 286 states and 528 transitions. Second operand 5 states. [2019-12-27 03:06:16,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:16,161 INFO L93 Difference]: Finished difference Result 488 states and 895 transitions. [2019-12-27 03:06:16,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:06:16,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 03:06:16,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:16,162 INFO L225 Difference]: With dead ends: 488 [2019-12-27 03:06:16,163 INFO L226 Difference]: Without dead ends: 221 [2019-12-27 03:06:16,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:06:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-12-27 03:06:16,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-12-27 03:06:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-27 03:06:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 398 transitions. [2019-12-27 03:06:16,169 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 398 transitions. Word has length 53 [2019-12-27 03:06:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:16,169 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 398 transitions. [2019-12-27 03:06:16,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:06:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 398 transitions. [2019-12-27 03:06:16,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:06:16,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:16,171 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 03:06:16,171 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:16,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:16,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1994007361, now seen corresponding path program 2 times [2019-12-27 03:06:16,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:16,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030068977] [2019-12-27 03:06:16,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:16,261 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 03:06:16,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030068977] [2019-12-27 03:06:16,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:16,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:06:16,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135355368] [2019-12-27 03:06:16,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:06:16,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:16,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:06:16,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:06:16,264 INFO L87 Difference]: Start difference. First operand 221 states and 398 transitions. Second operand 3 states. [2019-12-27 03:06:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:16,276 INFO L93 Difference]: Finished difference Result 209 states and 362 transitions. [2019-12-27 03:06:16,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:06:16,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 03:06:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:16,277 INFO L225 Difference]: With dead ends: 209 [2019-12-27 03:06:16,277 INFO L226 Difference]: Without dead ends: 209 [2019-12-27 03:06:16,278 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 03:06:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-27 03:06:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-12-27 03:06:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-27 03:06:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 362 transitions. [2019-12-27 03:06:16,283 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 362 transitions. Word has length 53 [2019-12-27 03:06:16,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:16,283 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 362 transitions. [2019-12-27 03:06:16,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:06:16,283 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 362 transitions. [2019-12-27 03:06:16,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 03:06:16,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:16,284 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 03:06:16,284 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:16,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:16,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1455781027, now seen corresponding path program 1 times [2019-12-27 03:06:16,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:16,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914919662] [2019-12-27 03:06:16,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:06:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:06:16,482 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:06:16,482 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:06:16,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] ULTIMATE.startENTRY-->L787: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x~0_169) (= 0 v_~x$read_delayed_var~0.offset_6) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1591~0.base_19|) (= |v_#NULL.offset_7| 0) (= v_~x$r_buff1_thd2~0_98 0) (= |v_ULTIMATE.start_main_~#t1591~0.offset_14| 0) (= 0 v_~__unbuffered_cnt~0_67) (= v_~main$tmp_guard1~0_21 0) (= |v_#valid_46| (store .cse0 |v_ULTIMATE.start_main_~#t1591~0.base_19| 1)) (= 0 v_~x$w_buff1_used~0_304) (= v_~x$r_buff0_thd0~0_295 0) (= 0 v_~x$r_buff0_thd2~0_162) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$read_delayed~0_6) (= v_~y~0_104 0) (= v_~__unbuffered_p1_EBX~0_62 0) (= v_~x$mem_tmp~0_16 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1591~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1591~0.base_19|) |v_ULTIMATE.start_main_~#t1591~0.offset_14| 0)) |v_#memory_int_17|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~weak$$choice2~0_83) (= 0 v_~weak$$choice0~0_11) (= 0 v_~__unbuffered_p1_EAX~0_62) (= 0 |v_#NULL.base_7|) (= 0 v_~x$w_buff1~0_172) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1591~0.base_19| 4) |v_#length_17|) (= v_~main$tmp_guard0~0_26 0) (= v_~x$r_buff1_thd1~0_135 0) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~x$w_buff0~0_199) (= v_~x$r_buff1_thd0~0_177 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1591~0.base_19|)) (= 0 v_~x$w_buff0_used~0_556))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_199, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_30|, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_32|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, ULTIMATE.start_main_~#t1592~0.base=|v_ULTIMATE.start_main_~#t1592~0.base_17|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1592~0.offset=|v_ULTIMATE.start_main_~#t1592~0.offset_14|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_295, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_31|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_15|, ~x$w_buff1~0=v_~x$w_buff1~0_172, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_304, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_98, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~x~0=v_~x~0_169, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_19|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_37|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_30|, ULTIMATE.start_main_~#t1591~0.base=|v_ULTIMATE.start_main_~#t1591~0.base_19|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ~y~0=v_~y~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_37|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_23|, ULTIMATE.start_main_~#t1591~0.offset=|v_ULTIMATE.start_main_~#t1591~0.offset_14|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_177, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_28|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_556, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ~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_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_23|, ~weak$$choice2~0=v_~weak$$choice2~0_83, ~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_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1592~0.base, #length, ULTIMATE.start_main_~#t1592~0.offset, ~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_~#t1591~0.base, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t1591~0.offset, 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, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:06:16,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L787-1-->L789: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1592~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t1592~0.base_10| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1592~0.base_10| 1)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1592~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1592~0.offset_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1592~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1592~0.base_10|) |v_ULTIMATE.start_main_~#t1592~0.offset_9| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1592~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1592~0.base=|v_ULTIMATE.start_main_~#t1592~0.base_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_3|, ULTIMATE.start_main_~#t1592~0.offset=|v_ULTIMATE.start_main_~#t1592~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1592~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1592~0.offset, #length] because there is no mapped edge [2019-12-27 03:06:16,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L4-->L764: Formula: (and (= ~y~0_Out-1935910674 1) (= 1 ~x$r_buff0_thd2~0_Out-1935910674) (= ~x$r_buff0_thd1~0_In-1935910674 ~x$r_buff1_thd1~0_Out-1935910674) (= ~y~0_Out-1935910674 ~__unbuffered_p1_EBX~0_Out-1935910674) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1935910674 0)) (= ~y~0_Out-1935910674 ~__unbuffered_p1_EAX~0_Out-1935910674) (= ~x$r_buff1_thd0~0_Out-1935910674 ~x$r_buff0_thd0~0_In-1935910674) (= ~x$r_buff1_thd2~0_Out-1935910674 ~x$r_buff0_thd2~0_In-1935910674)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1935910674, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1935910674, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1935910674, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1935910674} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1935910674, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1935910674, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1935910674, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-1935910674, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1935910674, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1935910674, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1935910674, ~y~0=~y~0_Out-1935910674, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1935910674, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1935910674} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 03:06:16,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L730-2-->L730-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1144452734 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1144452734 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In1144452734 |P0Thread1of1ForFork0_#t~ite3_Out1144452734|)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1144452734 |P0Thread1of1ForFork0_#t~ite3_Out1144452734|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1144452734, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1144452734, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1144452734, ~x~0=~x~0_In1144452734} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1144452734|, ~x$w_buff1~0=~x$w_buff1~0_In1144452734, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1144452734, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1144452734, ~x~0=~x~0_In1144452734} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-27 03:06:16,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L730-4-->L731: Formula: (= v_~x~0_20 |v_P0Thread1of1ForFork0_#t~ite3_16|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_16|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_15|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-27 03:06:16,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L731-->L731-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1497647242 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1497647242 256)))) (or (and (= ~x$w_buff0_used~0_In1497647242 |P0Thread1of1ForFork0_#t~ite5_Out1497647242|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1497647242|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1497647242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1497647242} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1497647242|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1497647242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1497647242} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:06:16,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L732-->L732-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-157864755 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-157864755 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-157864755 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-157864755 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-157864755| ~x$w_buff1_used~0_In-157864755) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-157864755| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-157864755, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-157864755, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-157864755, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-157864755} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-157864755|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-157864755, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-157864755, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-157864755, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-157864755} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:06:16,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In42292026 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In42292026 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out42292026|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out42292026| ~x$r_buff0_thd1~0_In42292026)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In42292026, ~x$w_buff0_used~0=~x$w_buff0_used~0_In42292026} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In42292026, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out42292026|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In42292026} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 03:06:16,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In2126612821 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2126612821 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In2126612821 |P1Thread1of1ForFork1_#t~ite11_Out2126612821|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out2126612821| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2126612821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2126612821} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out2126612821|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2126612821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2126612821} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 03:06:16,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L766-->L766-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In2133198130 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In2133198130 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In2133198130 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In2133198130 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out2133198130| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite12_Out2133198130| ~x$w_buff1_used~0_In2133198130) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2133198130, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2133198130, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2133198130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133198130} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2133198130, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2133198130, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out2133198130|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2133198130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133198130} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 03:06:16,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L767-->L768: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1068740796 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1068740796 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1068740796)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In-1068740796 ~x$r_buff0_thd2~0_Out-1068740796)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1068740796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1068740796} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1068740796|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1068740796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1068740796} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 03:06:16,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-202337936 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-202337936 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-202337936 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-202337936 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out-202337936| ~x$r_buff1_thd2~0_In-202337936) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite14_Out-202337936| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-202337936, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-202337936, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-202337936, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-202337936} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-202337936, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-202337936, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-202337936, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-202337936|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-202337936} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:06:16,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork1_#t~ite14_34|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, 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 03:06:16,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L734-->L734-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-801782884 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-801782884 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-801782884 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-801782884 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-801782884|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out-801782884| ~x$r_buff1_thd1~0_In-801782884)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-801782884, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-801782884, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-801782884, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-801782884} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-801782884, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-801782884|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-801782884, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-801782884, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-801782884} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:06:16,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_94 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94} 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 03:06:16,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L789-1-->L795: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:06:16,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In330265982 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In330265982 256) 0))) (or (and (= ~x$w_buff1~0_In330265982 |ULTIMATE.start_main_#t~ite17_Out330265982|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In330265982 |ULTIMATE.start_main_#t~ite17_Out330265982|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In330265982, ~x$w_buff1_used~0=~x$w_buff1_used~0_In330265982, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In330265982, ~x~0=~x~0_In330265982} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out330265982|, ~x$w_buff1~0=~x$w_buff1~0_In330265982, ~x$w_buff1_used~0=~x$w_buff1_used~0_In330265982, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In330265982, ~x~0=~x~0_In330265982} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 03:06:16,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [624] [624] L795-4-->L796: Formula: (= v_~x~0_42 |v_ULTIMATE.start_main_#t~ite17_11|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_10|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-27 03:06:16,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2099955270 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2099955270 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out2099955270| 0)) (and (= |ULTIMATE.start_main_#t~ite19_Out2099955270| ~x$w_buff0_used~0_In2099955270) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2099955270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2099955270} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2099955270, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2099955270|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2099955270} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 03:06:16,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In2141603535 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In2141603535 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In2141603535 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In2141603535 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out2141603535| ~x$w_buff1_used~0_In2141603535) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out2141603535|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2141603535, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2141603535, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2141603535, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2141603535} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2141603535, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2141603535, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out2141603535|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2141603535, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2141603535} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 03:06:16,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-2086851203 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2086851203 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-2086851203| ~x$r_buff0_thd0~0_In-2086851203)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-2086851203| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2086851203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2086851203} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2086851203, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-2086851203|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2086851203} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 03:06:16,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In214294010 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In214294010 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In214294010 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In214294010 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out214294010| ~x$r_buff1_thd0~0_In214294010)) (and (= |ULTIMATE.start_main_#t~ite22_Out214294010| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In214294010, ~x$w_buff1_used~0=~x$w_buff1_used~0_In214294010, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In214294010, ~x$w_buff0_used~0=~x$w_buff0_used~0_In214294010} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In214294010, ~x$w_buff1_used~0=~x$w_buff1_used~0_In214294010, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In214294010, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out214294010|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In214294010} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 03:06:16,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L812: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~x$r_buff0_thd0~0_150 v_~x$r_buff0_thd0~0_151)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_151, ~weak$$choice2~0=v_~weak$$choice2~0_40} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_150, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~weak$$choice2~0=v_~weak$$choice2~0_40} 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 03:06:16,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L814-->L817-1: Formula: (and (= v_~x$mem_tmp~0_10 v_~x~0_111) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_11 256)) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_111, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} 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 03:06:16,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L817-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:06:16,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:06:16 BasicIcfg [2019-12-27 03:06:16,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:06:16,607 INFO L168 Benchmark]: Toolchain (without parser) took 12162.29 ms. Allocated memory was 145.8 MB in the beginning and 512.2 MB in the end (delta: 366.5 MB). Free memory was 101.9 MB in the beginning and 135.5 MB in the end (delta: -33.6 MB). Peak memory consumption was 332.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:06:16,608 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 03:06:16,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.19 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.5 MB in the beginning and 158.3 MB in the end (delta: -56.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:06:16,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.92 ms. Allocated memory is still 203.9 MB. Free memory was 158.3 MB in the beginning and 155.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 03:06:16,611 INFO L168 Benchmark]: Boogie Preprocessor took 40.62 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 153.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:06:16,611 INFO L168 Benchmark]: RCFGBuilder took 897.29 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 108.4 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:06:16,612 INFO L168 Benchmark]: TraceAbstraction took 10326.46 ms. Allocated memory was 203.9 MB in the beginning and 512.2 MB in the end (delta: 308.3 MB). Free memory was 108.4 MB in the beginning and 135.5 MB in the end (delta: -27.1 MB). Peak memory consumption was 281.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:06:16,617 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.43 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 810.19 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.5 MB in the beginning and 158.3 MB in the end (delta: -56.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.92 ms. Allocated memory is still 203.9 MB. Free memory was 158.3 MB in the beginning and 155.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.62 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 153.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 897.29 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 108.4 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10326.46 ms. Allocated memory was 203.9 MB in the beginning and 512.2 MB in the end (delta: 308.3 MB). Free memory was 108.4 MB in the beginning and 135.5 MB in the end (delta: -27.1 MB). Peak memory consumption was 281.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 147 ProgramPointsBefore, 81 ProgramPointsAfterwards, 181 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 24 ChoiceCompositions, 3783 VarBasedMoverChecksPositive, 170 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 202 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 50487 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L787] FCALL, FORK 0 pthread_create(&t1591, ((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] [L789] FCALL, FORK 0 pthread_create(&t1592, ((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] [L744] 2 x$w_buff1 = x$w_buff0 [L745] 2 x$w_buff0 = 2 [L746] 2 x$w_buff1_used = x$w_buff0_used [L747] 2 x$w_buff0_used = (_Bool)1 [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [L730] 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=1, 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=2] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L764] 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=1, 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_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 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 [L764] 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) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 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 [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L795] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [L796] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L799] 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 [L802] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 0 x$flush_delayed = weak$$choice2 [L805] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [L806] 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=1, 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=2] [L806] 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) [L807] 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=1, 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=2] [L807] 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)) [L808] EXPR 0 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [L808] 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)) [L809] 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=1, 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=2] [L809] 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)) [L810] EXPR 0 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [L810] 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)) [L812] 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=1, 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=2] [L812] 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)) [L813] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.0s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 891 SDtfs, 408 SDslu, 862 SDs, 0 SdLazy, 309 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13038occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 1414 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 27118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...