/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:10:54,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:10:54,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:10:54,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:10:54,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:10:54,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:10:54,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:10:54,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:10:54,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:10:54,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:10:54,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:10:54,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:10:54,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:10:54,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:10:54,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:10:54,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:10:54,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:10:54,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:10:54,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:10:54,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:10:54,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:10:54,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:10:54,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:10:54,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:10:54,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:10:54,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:10:54,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:10:54,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:10:54,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:10:54,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:10:54,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:10:54,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:10:54,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:10:54,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:10:54,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:10:54,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:10:54,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:10:54,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:10:54,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:10:54,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:10:54,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:10:54,278 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:10:54,293 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:10:54,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:10:54,294 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:10:54,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:10:54,295 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:10:54,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:10:54,295 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:10:54,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:10:54,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:10:54,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:10:54,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:10:54,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:10:54,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:10:54,297 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:10:54,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:10:54,297 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:10:54,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:10:54,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:10:54,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:10:54,298 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:10:54,298 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:10:54,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:10:54,299 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:10:54,299 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:10:54,299 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:10:54,299 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:10:54,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:10:54,300 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:10:54,300 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:10:54,300 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:10:54,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:10:54,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:10:54,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:10:54,634 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:10:54,634 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:10:54,635 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_tso.opt.i [2019-12-26 23:10:54,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6fc3743/3a43b62e21cd4c62b8c5536f60d9af12/FLAG979d33335 [2019-12-26 23:10:55,240 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:10:55,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_tso.opt.i [2019-12-26 23:10:55,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6fc3743/3a43b62e21cd4c62b8c5536f60d9af12/FLAG979d33335 [2019-12-26 23:10:55,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6fc3743/3a43b62e21cd4c62b8c5536f60d9af12 [2019-12-26 23:10:55,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:10:55,469 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:10:55,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:10:55,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:10:55,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:10:55,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:10:55" (1/1) ... [2019-12-26 23:10:55,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b1d233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:55, skipping insertion in model container [2019-12-26 23:10:55,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:10:55" (1/1) ... [2019-12-26 23:10:55,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:10:55,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:10:56,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:10:56,060 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:10:56,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:10:56,221 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:10:56,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:56 WrapperNode [2019-12-26 23:10:56,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:10:56,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:10:56,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:10:56,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:10:56,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:56" (1/1) ... [2019-12-26 23:10:56,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:56" (1/1) ... [2019-12-26 23:10:56,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:10:56,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:10:56,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:10:56,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:10:56,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:56" (1/1) ... [2019-12-26 23:10:56,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:56" (1/1) ... [2019-12-26 23:10:56,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:56" (1/1) ... [2019-12-26 23:10:56,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:56" (1/1) ... [2019-12-26 23:10:56,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:56" (1/1) ... [2019-12-26 23:10:56,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:56" (1/1) ... [2019-12-26 23:10:56,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:56" (1/1) ... [2019-12-26 23:10:56,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:10:56,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:10:56,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:10:56,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:10:56,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:56" (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-26 23:10:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:10:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:10:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:10:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:10:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:10:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:10:56,403 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:10:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:10:56,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:10:56,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:10:56,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:10:56,405 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:10:57,095 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:10:57,096 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:10:57,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:10:57 BoogieIcfgContainer [2019-12-26 23:10:57,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:10:57,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:10:57,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:10:57,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:10:57,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:10:55" (1/3) ... [2019-12-26 23:10:57,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2aa4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:10:57, skipping insertion in model container [2019-12-26 23:10:57,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:56" (2/3) ... [2019-12-26 23:10:57,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2aa4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:10:57, skipping insertion in model container [2019-12-26 23:10:57,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:10:57" (3/3) ... [2019-12-26 23:10:57,106 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_tso.opt.i [2019-12-26 23:10:57,116 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:10:57,117 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:10:57,124 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:10:57,125 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:10:57,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,161 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,161 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,170 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,171 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,171 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,171 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,172 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,185 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,185 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,187 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,188 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,188 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:57,206 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:10:57,227 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:10:57,228 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:10:57,228 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:10:57,228 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:10:57,228 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:10:57,228 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:10:57,228 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:10:57,229 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:10:57,245 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-26 23:10:57,247 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-26 23:10:57,377 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-26 23:10:57,378 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:10:57,394 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:10:57,413 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-26 23:10:57,491 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-26 23:10:57,492 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:10:57,499 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:10:57,513 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-26 23:10:57,514 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:11:01,937 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 23:11:02,079 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 23:11:02,112 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46553 [2019-12-26 23:11:02,112 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-26 23:11:02,116 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-26 23:11:02,557 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8413 states. [2019-12-26 23:11:02,560 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states. [2019-12-26 23:11:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:11:02,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:02,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:11:02,568 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:02,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:02,576 INFO L82 PathProgramCache]: Analyzing trace with hash 698534967, now seen corresponding path program 1 times [2019-12-26 23:11:02,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:02,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101465541] [2019-12-26 23:11:02,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:02,827 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-26 23:11:02,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101465541] [2019-12-26 23:11:02,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:02,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:11:02,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632884462] [2019-12-26 23:11:02,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:11:02,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:02,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:11:02,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:11:02,848 INFO L87 Difference]: Start difference. First operand 8413 states. Second operand 3 states. [2019-12-26 23:11:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:03,247 INFO L93 Difference]: Finished difference Result 8365 states and 27377 transitions. [2019-12-26 23:11:03,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:11:03,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:11:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:03,403 INFO L225 Difference]: With dead ends: 8365 [2019-12-26 23:11:03,404 INFO L226 Difference]: Without dead ends: 8196 [2019-12-26 23:11:03,406 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-26 23:11:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8196 states. [2019-12-26 23:11:03,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8196 to 8196. [2019-12-26 23:11:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-12-26 23:11:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 26857 transitions. [2019-12-26 23:11:03,946 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 26857 transitions. Word has length 5 [2019-12-26 23:11:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:03,947 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 26857 transitions. [2019-12-26 23:11:03,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:11:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 26857 transitions. [2019-12-26 23:11:03,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:11:03,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:03,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:11:03,952 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:03,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:03,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1108629868, now seen corresponding path program 1 times [2019-12-26 23:11:03,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:03,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937892759] [2019-12-26 23:11:03,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:04,100 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-26 23:11:04,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937892759] [2019-12-26 23:11:04,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:04,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:11:04,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508540341] [2019-12-26 23:11:04,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:11:04,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:04,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:11:04,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:11:04,103 INFO L87 Difference]: Start difference. First operand 8196 states and 26857 transitions. Second operand 4 states. [2019-12-26 23:11:04,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:04,604 INFO L93 Difference]: Finished difference Result 13084 states and 41046 transitions. [2019-12-26 23:11:04,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:11:04,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:11:04,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:04,797 INFO L225 Difference]: With dead ends: 13084 [2019-12-26 23:11:04,797 INFO L226 Difference]: Without dead ends: 13077 [2019-12-26 23:11:04,799 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-26 23:11:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13077 states. [2019-12-26 23:11:05,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13077 to 11568. [2019-12-26 23:11:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11568 states. [2019-12-26 23:11:05,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11568 states to 11568 states and 36838 transitions. [2019-12-26 23:11:05,242 INFO L78 Accepts]: Start accepts. Automaton has 11568 states and 36838 transitions. Word has length 11 [2019-12-26 23:11:05,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:05,242 INFO L462 AbstractCegarLoop]: Abstraction has 11568 states and 36838 transitions. [2019-12-26 23:11:05,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:11:05,242 INFO L276 IsEmpty]: Start isEmpty. Operand 11568 states and 36838 transitions. [2019-12-26 23:11:05,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:11:05,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:05,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:11:05,250 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:05,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:05,250 INFO L82 PathProgramCache]: Analyzing trace with hash 531606898, now seen corresponding path program 1 times [2019-12-26 23:11:05,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:05,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015738194] [2019-12-26 23:11:05,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:11:05,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015738194] [2019-12-26 23:11:05,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:05,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:11:05,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301993725] [2019-12-26 23:11:05,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:11:05,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:05,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:11:05,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:11:05,365 INFO L87 Difference]: Start difference. First operand 11568 states and 36838 transitions. Second operand 4 states. [2019-12-26 23:11:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:05,611 INFO L93 Difference]: Finished difference Result 14627 states and 46118 transitions. [2019-12-26 23:11:05,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:11:05,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:11:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:05,661 INFO L225 Difference]: With dead ends: 14627 [2019-12-26 23:11:05,661 INFO L226 Difference]: Without dead ends: 14627 [2019-12-26 23:11:05,662 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-26 23:11:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14627 states. [2019-12-26 23:11:06,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14627 to 12851. [2019-12-26 23:11:06,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12851 states. [2019-12-26 23:11:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12851 states to 12851 states and 40863 transitions. [2019-12-26 23:11:06,685 INFO L78 Accepts]: Start accepts. Automaton has 12851 states and 40863 transitions. Word has length 11 [2019-12-26 23:11:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:06,685 INFO L462 AbstractCegarLoop]: Abstraction has 12851 states and 40863 transitions. [2019-12-26 23:11:06,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:11:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 12851 states and 40863 transitions. [2019-12-26 23:11:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 23:11:06,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:06,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:11:06,689 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:06,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:06,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1151367975, now seen corresponding path program 1 times [2019-12-26 23:11:06,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:06,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12890372] [2019-12-26 23:11:06,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:06,768 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-26 23:11:06,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12890372] [2019-12-26 23:11:06,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:06,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:11:06,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744810861] [2019-12-26 23:11:06,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:11:06,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:06,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:11:06,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:11:06,770 INFO L87 Difference]: Start difference. First operand 12851 states and 40863 transitions. Second operand 5 states. [2019-12-26 23:11:07,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:07,255 INFO L93 Difference]: Finished difference Result 17501 states and 54434 transitions. [2019-12-26 23:11:07,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:11:07,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 23:11:07,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:07,314 INFO L225 Difference]: With dead ends: 17501 [2019-12-26 23:11:07,314 INFO L226 Difference]: Without dead ends: 17494 [2019-12-26 23:11:07,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:11:07,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17494 states. [2019-12-26 23:11:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17494 to 12893. [2019-12-26 23:11:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12893 states. [2019-12-26 23:11:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12893 states to 12893 states and 40855 transitions. [2019-12-26 23:11:07,847 INFO L78 Accepts]: Start accepts. Automaton has 12893 states and 40855 transitions. Word has length 17 [2019-12-26 23:11:07,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:07,848 INFO L462 AbstractCegarLoop]: Abstraction has 12893 states and 40855 transitions. [2019-12-26 23:11:07,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:11:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 12893 states and 40855 transitions. [2019-12-26 23:11:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:11:07,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:07,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:11:07,864 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:07,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:07,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2101636237, now seen corresponding path program 1 times [2019-12-26 23:11:07,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:07,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028217947] [2019-12-26 23:11:07,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:07,936 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-26 23:11:07,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028217947] [2019-12-26 23:11:07,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:07,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:11:07,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026941699] [2019-12-26 23:11:07,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:11:07,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:07,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:11:07,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:11:07,938 INFO L87 Difference]: Start difference. First operand 12893 states and 40855 transitions. Second operand 3 states. [2019-12-26 23:11:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:08,046 INFO L93 Difference]: Finished difference Result 15714 states and 49940 transitions. [2019-12-26 23:11:08,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:11:08,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-26 23:11:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:08,119 INFO L225 Difference]: With dead ends: 15714 [2019-12-26 23:11:08,119 INFO L226 Difference]: Without dead ends: 15714 [2019-12-26 23:11:08,120 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-26 23:11:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15714 states. [2019-12-26 23:11:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15714 to 14811. [2019-12-26 23:11:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14811 states. [2019-12-26 23:11:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14811 states to 14811 states and 47249 transitions. [2019-12-26 23:11:08,647 INFO L78 Accepts]: Start accepts. Automaton has 14811 states and 47249 transitions. Word has length 25 [2019-12-26 23:11:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:08,650 INFO L462 AbstractCegarLoop]: Abstraction has 14811 states and 47249 transitions. [2019-12-26 23:11:08,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:11:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 14811 states and 47249 transitions. [2019-12-26 23:11:08,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:11:08,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:08,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:11:08,666 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:08,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:08,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1939096541, now seen corresponding path program 1 times [2019-12-26 23:11:08,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:08,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094963138] [2019-12-26 23:11:08,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:08,760 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-26 23:11:08,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094963138] [2019-12-26 23:11:08,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:08,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:11:08,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454585550] [2019-12-26 23:11:08,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:11:08,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:08,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:11:08,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:11:08,762 INFO L87 Difference]: Start difference. First operand 14811 states and 47249 transitions. Second operand 4 states. [2019-12-26 23:11:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:08,797 INFO L93 Difference]: Finished difference Result 2380 states and 5507 transitions. [2019-12-26 23:11:08,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:11:08,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:11:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:08,800 INFO L225 Difference]: With dead ends: 2380 [2019-12-26 23:11:08,801 INFO L226 Difference]: Without dead ends: 2094 [2019-12-26 23:11:08,801 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-26 23:11:08,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2019-12-26 23:11:08,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2094. [2019-12-26 23:11:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2019-12-26 23:11:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 4716 transitions. [2019-12-26 23:11:08,840 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 4716 transitions. Word has length 25 [2019-12-26 23:11:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:08,840 INFO L462 AbstractCegarLoop]: Abstraction has 2094 states and 4716 transitions. [2019-12-26 23:11:08,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:11:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 4716 transitions. [2019-12-26 23:11:08,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:11:08,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:08,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:11:08,844 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:08,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:08,844 INFO L82 PathProgramCache]: Analyzing trace with hash -673430796, now seen corresponding path program 1 times [2019-12-26 23:11:08,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:08,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930240880] [2019-12-26 23:11:08,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:08,964 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-26 23:11:08,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930240880] [2019-12-26 23:11:08,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:08,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:11:08,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374272528] [2019-12-26 23:11:08,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:11:08,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:08,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:11:08,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:11:08,966 INFO L87 Difference]: Start difference. First operand 2094 states and 4716 transitions. Second operand 5 states. [2019-12-26 23:11:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:09,010 INFO L93 Difference]: Finished difference Result 429 states and 783 transitions. [2019-12-26 23:11:09,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:11:09,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 23:11:09,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:09,012 INFO L225 Difference]: With dead ends: 429 [2019-12-26 23:11:09,012 INFO L226 Difference]: Without dead ends: 383 [2019-12-26 23:11:09,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:11:09,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-12-26 23:11:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 348. [2019-12-26 23:11:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-26 23:11:09,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 628 transitions. [2019-12-26 23:11:09,022 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 628 transitions. Word has length 37 [2019-12-26 23:11:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:09,022 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 628 transitions. [2019-12-26 23:11:09,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:11:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 628 transitions. [2019-12-26 23:11:09,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:11:09,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:09,024 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-26 23:11:09,024 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:09,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:09,025 INFO L82 PathProgramCache]: Analyzing trace with hash 939573543, now seen corresponding path program 1 times [2019-12-26 23:11:09,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:09,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180705508] [2019-12-26 23:11:09,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:09,103 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-26 23:11:09,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180705508] [2019-12-26 23:11:09,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:09,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:11:09,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81434084] [2019-12-26 23:11:09,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:11:09,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:09,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:11:09,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:11:09,105 INFO L87 Difference]: Start difference. First operand 348 states and 628 transitions. Second operand 3 states. [2019-12-26 23:11:09,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:09,147 INFO L93 Difference]: Finished difference Result 352 states and 622 transitions. [2019-12-26 23:11:09,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:11:09,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:11:09,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:09,149 INFO L225 Difference]: With dead ends: 352 [2019-12-26 23:11:09,149 INFO L226 Difference]: Without dead ends: 352 [2019-12-26 23:11:09,149 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-26 23:11:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-12-26 23:11:09,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2019-12-26 23:11:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-26 23:11:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 614 transitions. [2019-12-26 23:11:09,156 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 614 transitions. Word has length 52 [2019-12-26 23:11:09,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:09,157 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 614 transitions. [2019-12-26 23:11:09,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:11:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 614 transitions. [2019-12-26 23:11:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:11:09,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:09,160 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-26 23:11:09,160 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:09,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:09,163 INFO L82 PathProgramCache]: Analyzing trace with hash 933754688, now seen corresponding path program 1 times [2019-12-26 23:11:09,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:09,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499818467] [2019-12-26 23:11:09,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:09,253 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-26 23:11:09,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499818467] [2019-12-26 23:11:09,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:09,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:11:09,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310305721] [2019-12-26 23:11:09,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:11:09,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:09,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:11:09,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:11:09,256 INFO L87 Difference]: Start difference. First operand 344 states and 614 transitions. Second operand 3 states. [2019-12-26 23:11:09,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:09,273 INFO L93 Difference]: Finished difference Result 344 states and 601 transitions. [2019-12-26 23:11:09,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:11:09,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:11:09,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:09,274 INFO L225 Difference]: With dead ends: 344 [2019-12-26 23:11:09,274 INFO L226 Difference]: Without dead ends: 344 [2019-12-26 23:11:09,274 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-26 23:11:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-26 23:11:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-12-26 23:11:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-26 23:11:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 601 transitions. [2019-12-26 23:11:09,280 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 601 transitions. Word has length 52 [2019-12-26 23:11:09,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:09,281 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 601 transitions. [2019-12-26 23:11:09,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:11:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 601 transitions. [2019-12-26 23:11:09,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:11:09,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:09,282 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-26 23:11:09,283 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:09,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:09,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1595558797, now seen corresponding path program 1 times [2019-12-26 23:11:09,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:09,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151516420] [2019-12-26 23:11:09,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:09,557 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-26 23:11:09,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151516420] [2019-12-26 23:11:09,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:09,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:11:09,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577812143] [2019-12-26 23:11:09,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:11:09,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:09,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:11:09,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:11:09,559 INFO L87 Difference]: Start difference. First operand 344 states and 601 transitions. Second operand 10 states. [2019-12-26 23:11:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:10,345 INFO L93 Difference]: Finished difference Result 486 states and 834 transitions. [2019-12-26 23:11:10,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:11:10,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-26 23:11:10,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:10,346 INFO L225 Difference]: With dead ends: 486 [2019-12-26 23:11:10,346 INFO L226 Difference]: Without dead ends: 486 [2019-12-26 23:11:10,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:11:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-12-26 23:11:10,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 408. [2019-12-26 23:11:10,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-26 23:11:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 705 transitions. [2019-12-26 23:11:10,354 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 705 transitions. Word has length 53 [2019-12-26 23:11:10,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:10,354 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 705 transitions. [2019-12-26 23:11:10,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:11:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 705 transitions. [2019-12-26 23:11:10,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:11:10,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:10,356 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-26 23:11:10,356 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:10,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:10,356 INFO L82 PathProgramCache]: Analyzing trace with hash 165214383, now seen corresponding path program 2 times [2019-12-26 23:11:10,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:10,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906209467] [2019-12-26 23:11:10,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:10,425 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-26 23:11:10,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906209467] [2019-12-26 23:11:10,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:10,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:11:10,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657724977] [2019-12-26 23:11:10,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:11:10,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:10,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:11:10,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:11:10,428 INFO L87 Difference]: Start difference. First operand 408 states and 705 transitions. Second operand 3 states. [2019-12-26 23:11:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:10,461 INFO L93 Difference]: Finished difference Result 407 states and 703 transitions. [2019-12-26 23:11:10,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:11:10,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-26 23:11:10,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:10,462 INFO L225 Difference]: With dead ends: 407 [2019-12-26 23:11:10,462 INFO L226 Difference]: Without dead ends: 407 [2019-12-26 23:11:10,463 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-26 23:11:10,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-12-26 23:11:10,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 341. [2019-12-26 23:11:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-26 23:11:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 587 transitions. [2019-12-26 23:11:10,469 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 587 transitions. Word has length 53 [2019-12-26 23:11:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:10,469 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 587 transitions. [2019-12-26 23:11:10,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:11:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 587 transitions. [2019-12-26 23:11:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:11:10,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:10,471 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-26 23:11:10,471 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:10,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:10,472 INFO L82 PathProgramCache]: Analyzing trace with hash -798816837, now seen corresponding path program 1 times [2019-12-26 23:11:10,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:10,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146499689] [2019-12-26 23:11:10,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:10,759 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-26 23:11:10,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146499689] [2019-12-26 23:11:10,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:10,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:11:10,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314099318] [2019-12-26 23:11:10,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:11:10,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:10,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:11:10,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:11:10,761 INFO L87 Difference]: Start difference. First operand 341 states and 587 transitions. Second operand 13 states. [2019-12-26 23:11:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:11,317 INFO L93 Difference]: Finished difference Result 652 states and 1124 transitions. [2019-12-26 23:11:11,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:11:11,318 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-26 23:11:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:11,319 INFO L225 Difference]: With dead ends: 652 [2019-12-26 23:11:11,319 INFO L226 Difference]: Without dead ends: 283 [2019-12-26 23:11:11,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:11:11,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-12-26 23:11:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 250. [2019-12-26 23:11:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-26 23:11:11,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 417 transitions. [2019-12-26 23:11:11,324 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 417 transitions. Word has length 54 [2019-12-26 23:11:11,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:11,325 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 417 transitions. [2019-12-26 23:11:11,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:11:11,325 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 417 transitions. [2019-12-26 23:11:11,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:11:11,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:11,326 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-26 23:11:11,326 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:11,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:11,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1642640547, now seen corresponding path program 2 times [2019-12-26 23:11:11,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:11,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011178277] [2019-12-26 23:11:11,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:11,616 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-26 23:11:11,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011178277] [2019-12-26 23:11:11,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:11,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:11:11,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338444750] [2019-12-26 23:11:11,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:11:11,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:11,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:11:11,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:11:11,620 INFO L87 Difference]: Start difference. First operand 250 states and 417 transitions. Second operand 12 states. [2019-12-26 23:11:12,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:12,231 INFO L93 Difference]: Finished difference Result 433 states and 670 transitions. [2019-12-26 23:11:12,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:11:12,231 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-26 23:11:12,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:12,232 INFO L225 Difference]: With dead ends: 433 [2019-12-26 23:11:12,232 INFO L226 Difference]: Without dead ends: 206 [2019-12-26 23:11:12,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2019-12-26 23:11:12,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-12-26 23:11:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2019-12-26 23:11:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-12-26 23:11:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 297 transitions. [2019-12-26 23:11:12,237 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 297 transitions. Word has length 54 [2019-12-26 23:11:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:12,237 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 297 transitions. [2019-12-26 23:11:12,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:11:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 297 transitions. [2019-12-26 23:11:12,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:11:12,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:12,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:11:12,238 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:12,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:12,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1731930561, now seen corresponding path program 3 times [2019-12-26 23:11:12,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:12,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648548114] [2019-12-26 23:11:12,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:11:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:11:12,416 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:11:12,416 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:11:12,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~z~0_122 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1615~0.base_19|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1615~0.base_19|) (= v_~y$mem_tmp~0_21 0) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~weak$$choice2~0_120 0) (= v_~__unbuffered_p1_EAX~0_131 0) (= v_~y$r_buff0_thd0~0_347 0) (= 0 v_~y$r_buff1_thd2~0_171) (= v_~x~0_94 0) (= 0 v_~weak$$choice0~0_15) (= v_~y$read_delayed~0_6 0) (= |v_ULTIMATE.start_main_~#t1615~0.offset_14| 0) (= 0 v_~y$r_buff0_thd2~0_225) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~__unbuffered_cnt~0_63) (= v_~y$r_buff0_thd1~0_109 0) (= v_~y$w_buff0_used~0_663 0) (= v_~y$w_buff1~0_180 0) (= 0 v_~y$flush_delayed~0_36) (= |v_#NULL.offset_5| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1615~0.base_19| 4)) (= |v_#valid_40| (store .cse0 |v_ULTIMATE.start_main_~#t1615~0.base_19| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1615~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1615~0.base_19|) |v_ULTIMATE.start_main_~#t1615~0.offset_14| 0)) |v_#memory_int_15|) (= v_~y~0_158 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff1_thd0~0_274 0) (= 0 v_~y$w_buff0~0_245) (= v_~main$tmp_guard1~0_25 0) (= v_~y$w_buff1_used~0_350 0) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_33|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t1615~0.offset=|v_ULTIMATE.start_main_~#t1615~0.offset_14|, ~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_131, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_109, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, #length=|v_#length_15|, ULTIMATE.start_main_~#t1615~0.base=|v_ULTIMATE.start_main_~#t1615~0.base_19|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_~#t1616~0.offset=|v_ULTIMATE.start_main_~#t1616~0.offset_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_28|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_46|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ~y$w_buff1~0=v_~y$w_buff1~0_180, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_225, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_274, ~x~0=v_~x~0_94, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_663, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_25|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_44|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_45|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_42|, ~y$w_buff0~0=v_~y$w_buff0~0_245, ULTIMATE.start_main_~#t1616~0.base=|v_ULTIMATE.start_main_~#t1616~0.base_16|, ~y~0=v_~y~0_158, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_31|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_34|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_347, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~z~0=v_~z~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t1615~0.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1615~0.base, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1616~0.offset, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ULTIMATE.start_main_~#t1616~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:11:12,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L789-1-->L791: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1616~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t1616~0.offset_10| 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1616~0.base_11| 4) |v_#length_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1616~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1616~0.base_11|) |v_ULTIMATE.start_main_~#t1616~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1616~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1616~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1616~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1616~0.offset=|v_ULTIMATE.start_main_~#t1616~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t1616~0.base=|v_ULTIMATE.start_main_~#t1616~0.base_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1616~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1616~0.base, #length] because there is no mapped edge [2019-12-26 23:11:12,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] P1ENTRY-->L4-3: Formula: (and (= 0 (mod v_~y$w_buff1_used~0_47 256)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= 1 v_~y$w_buff0_used~0_86) (= 2 v_~y$w_buff0~0_19) (= v_~y$w_buff0~0_20 v_~y$w_buff1~0_21) (= v_~y$w_buff1_used~0_47 v_~y$w_buff0_used~0_87)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff0~0=v_~y$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$w_buff1~0=v_~y$w_buff1~0_21, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~y$w_buff0~0=v_~y$w_buff0~0_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_47} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:11:12,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L732-2-->L732-5: Formula: (let ((.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out-1037578755| |P0Thread1of1ForFork0_#t~ite3_Out-1037578755|)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1037578755 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1037578755 256)))) (or (and (not .cse0) .cse1 (= |P0Thread1of1ForFork0_#t~ite3_Out-1037578755| ~y$w_buff1~0_In-1037578755) (not .cse2)) (and .cse1 (= |P0Thread1of1ForFork0_#t~ite3_Out-1037578755| ~y~0_In-1037578755) (or .cse0 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1037578755, ~y$w_buff1~0=~y$w_buff1~0_In-1037578755, ~y~0=~y~0_In-1037578755, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1037578755} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1037578755, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1037578755|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1037578755|, ~y$w_buff1~0=~y$w_buff1~0_In-1037578755, ~y~0=~y~0_In-1037578755, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1037578755} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 23:11:12,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-902250817 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-902250817 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-902250817| ~y$w_buff0_used~0_In-902250817) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-902250817| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-902250817, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-902250817} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-902250817|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-902250817, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-902250817} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:11:12,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In113657038 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In113657038 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In113657038 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In113657038 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out113657038| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out113657038| ~y$w_buff1_used~0_In113657038)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In113657038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In113657038, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In113657038, ~y$w_buff1_used~0=~y$w_buff1_used~0_In113657038} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out113657038|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In113657038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In113657038, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In113657038, ~y$w_buff1_used~0=~y$w_buff1_used~0_In113657038} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:11:12,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1305320642 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1305320642 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In1305320642 |P0Thread1of1ForFork0_#t~ite7_Out1305320642|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1305320642|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1305320642, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1305320642} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1305320642, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1305320642|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1305320642} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:11:12,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L736-->L736-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1112482711 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1112482711 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1112482711 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1112482711 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1112482711| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1112482711| ~y$r_buff1_thd1~0_In-1112482711) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1112482711, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1112482711, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1112482711, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1112482711} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1112482711, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1112482711, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1112482711|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1112482711, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1112482711} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:11:12,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (= v_~y$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_32|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_125, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:11:12,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1597100040 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1597100040 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1597100040|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1597100040| ~y$w_buff0_used~0_In-1597100040)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1597100040, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1597100040} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1597100040, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1597100040, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1597100040|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:11:12,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1084044293 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1084044293 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1084044293 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1084044293 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1084044293|)) (and (= ~y$w_buff1_used~0_In-1084044293 |P1Thread1of1ForFork1_#t~ite12_Out-1084044293|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1084044293, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1084044293, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1084044293, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1084044293} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1084044293, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1084044293, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1084044293, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1084044293|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1084044293} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:11:12,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L769-->L770: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2011640737 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2011640737 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd2~0_Out-2011640737 0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_Out-2011640737 ~y$r_buff0_thd2~0_In-2011640737) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2011640737, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2011640737} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2011640737, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-2011640737, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-2011640737|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-26 23:11:12,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In998778049 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In998778049 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In998778049 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In998778049 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In998778049 |P1Thread1of1ForFork1_#t~ite14_Out998778049|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out998778049|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In998778049, ~y$w_buff0_used~0=~y$w_buff0_used~0_In998778049, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In998778049, ~y$w_buff1_used~0=~y$w_buff1_used~0_In998778049} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In998778049, ~y$w_buff0_used~0=~y$w_buff0_used~0_In998778049, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In998778049, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out998778049|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In998778049} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:11:12,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_144 |v_P1Thread1of1ForFork1_#t~ite14_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_144, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:11:12,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_132 256)) (= 0 (mod v_~y$w_buff0_used~0_236 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:11:12,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1055207629 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1055207629 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out1055207629| ~y~0_In1055207629) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out1055207629| ~y$w_buff1~0_In1055207629) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1055207629, ~y~0=~y~0_In1055207629, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1055207629, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1055207629} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1055207629|, ~y$w_buff1~0=~y$w_buff1~0_In1055207629, ~y~0=~y~0_In1055207629, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1055207629, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1055207629} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-26 23:11:12,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [619] [619] L797-4-->L798: Formula: (= v_~y~0_44 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~y~0=v_~y~0_44} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-26 23:11:12,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1483229257 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1483229257 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1483229257 |ULTIMATE.start_main_#t~ite19_Out-1483229257|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite19_Out-1483229257| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1483229257, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1483229257} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1483229257, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1483229257|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1483229257} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 23:11:12,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In2124487593 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In2124487593 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2124487593 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In2124487593 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out2124487593| ~y$w_buff1_used~0_In2124487593) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out2124487593|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2124487593, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2124487593, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2124487593, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2124487593} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2124487593, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2124487593, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out2124487593|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2124487593, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2124487593} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 23:11:12,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-380813098 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-380813098 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-380813098|)) (and (= ~y$r_buff0_thd0~0_In-380813098 |ULTIMATE.start_main_#t~ite21_Out-380813098|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-380813098, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-380813098} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-380813098, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-380813098, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-380813098|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 23:11:12,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1628341912 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1628341912 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1628341912 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1628341912 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out1628341912| ~y$r_buff1_thd0~0_In1628341912) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite22_Out1628341912| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1628341912, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1628341912, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1628341912, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1628341912} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1628341912, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1628341912, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1628341912, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1628341912|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1628341912} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 23:11:12,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L812-->L812-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In352834308 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_In352834308| |ULTIMATE.start_main_#t~ite37_Out352834308|) (= ~y$w_buff1_used~0_In352834308 |ULTIMATE.start_main_#t~ite38_Out352834308|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In352834308 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In352834308 256))) (and (= (mod ~y$r_buff1_thd0~0_In352834308 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In352834308 256) 0))) .cse0 (= |ULTIMATE.start_main_#t~ite38_Out352834308| |ULTIMATE.start_main_#t~ite37_Out352834308|) (= ~y$w_buff1_used~0_In352834308 |ULTIMATE.start_main_#t~ite37_Out352834308|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In352834308, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In352834308, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In352834308|, ~weak$$choice2~0=~weak$$choice2~0_In352834308, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In352834308, ~y$w_buff1_used~0=~y$w_buff1_used~0_In352834308} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In352834308, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In352834308, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out352834308|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out352834308|, ~weak$$choice2~0=~weak$$choice2~0_In352834308, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In352834308, ~y$w_buff1_used~0=~y$w_buff1_used~0_In352834308} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-26 23:11:12,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [607] [607] L813-->L814: Formula: (and (= v_~y$r_buff0_thd0~0_98 v_~y$r_buff0_thd0~0_97) (not (= 0 (mod v_~weak$$choice2~0_26 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-26 23:11:12,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L816-->L819-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_16 256)) (not (= (mod v_~y$flush_delayed~0_27 256) 0)) (= v_~y~0_114 v_~y$mem_tmp~0_17) (= 0 v_~y$flush_delayed~0_26)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_114, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_18|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:11:12,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:11:12,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:11:12 BasicIcfg [2019-12-26 23:11:12,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:11:12,584 INFO L168 Benchmark]: Toolchain (without parser) took 17114.06 ms. Allocated memory was 144.7 MB in the beginning and 639.1 MB in the end (delta: 494.4 MB). Free memory was 99.4 MB in the beginning and 83.6 MB in the end (delta: 15.8 MB). Peak memory consumption was 510.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:11:12,585 INFO L168 Benchmark]: CDTParser took 0.75 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 23:11:12,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.03 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 99.0 MB in the beginning and 154.6 MB in the end (delta: -55.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:11:12,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.67 ms. Allocated memory is still 201.3 MB. Free memory was 154.6 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:11:12,592 INFO L168 Benchmark]: Boogie Preprocessor took 52.84 ms. Allocated memory is still 201.3 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:11:12,593 INFO L168 Benchmark]: RCFGBuilder took 755.36 ms. Allocated memory is still 201.3 MB. Free memory was 149.1 MB in the beginning and 104.8 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:11:12,593 INFO L168 Benchmark]: TraceAbstraction took 15481.36 ms. Allocated memory was 201.3 MB in the beginning and 639.1 MB in the end (delta: 437.8 MB). Free memory was 104.2 MB in the beginning and 83.6 MB in the end (delta: 20.5 MB). Peak memory consumption was 458.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:11:12,605 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.75 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 753.03 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 99.0 MB in the beginning and 154.6 MB in the end (delta: -55.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.67 ms. Allocated memory is still 201.3 MB. Free memory was 154.6 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.84 ms. Allocated memory is still 201.3 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 755.36 ms. Allocated memory is still 201.3 MB. Free memory was 149.1 MB in the beginning and 104.8 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15481.36 ms. Allocated memory was 201.3 MB in the beginning and 639.1 MB in the end (delta: 437.8 MB). Free memory was 104.2 MB in the beginning and 83.6 MB in the end (delta: 20.5 MB). Peak memory consumption was 458.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 148 ProgramPointsBefore, 78 ProgramPointsAfterwards, 182 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3838 VarBasedMoverChecksPositive, 191 VarBasedMoverChecksNegative, 62 SemBasedMoverChecksPositive, 187 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 46553 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1615, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1616, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L734] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1366 SDtfs, 1488 SDslu, 2847 SDs, 0 SdLazy, 1823 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 14 SyntacticMatches, 12 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14811occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 9033 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 503 NumberOfCodeBlocks, 503 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 436 ConstructedInterpolants, 0 QuantifiedInterpolants, 75772 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...