/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:04:09,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:04:09,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:04:09,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:04:09,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:04:09,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:04:09,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:04:09,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:04:09,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:04:09,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:04:09,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:04:09,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:04:09,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:04:09,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:04:09,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:04:09,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:04:09,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:04:09,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:04:09,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:04:09,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:04:09,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:04:09,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:04:09,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:04:09,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:04:09,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:04:09,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:04:09,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:04:09,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:04:09,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:04:09,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:04:09,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:04:09,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:04:09,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:04:09,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:04:09,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:04:09,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:04:09,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:04:09,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:04:09,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:04:09,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:04:09,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:04:09,088 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:04:09,104 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:04:09,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:04:09,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:04:09,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:04:09,106 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:04:09,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:04:09,107 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:04:09,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:04:09,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:04:09,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:04:09,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:04:09,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:04:09,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:04:09,108 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:04:09,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:04:09,109 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:04:09,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:04:09,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:04:09,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:04:09,110 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:04:09,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:04:09,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:04:09,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:04:09,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:04:09,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:04:09,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:04:09,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:04:09,112 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:04:09,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:04:09,113 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:04:09,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:04:09,401 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:04:09,404 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:04:09,406 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:04:09,406 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:04:09,407 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_pso.opt.i [2019-12-27 06:04:09,488 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d189cca/f148c0722dcf4490b378523f29c4748e/FLAG609ea1ee4 [2019-12-27 06:04:10,113 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:04:10,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_pso.opt.i [2019-12-27 06:04:10,138 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d189cca/f148c0722dcf4490b378523f29c4748e/FLAG609ea1ee4 [2019-12-27 06:04:10,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d189cca/f148c0722dcf4490b378523f29c4748e [2019-12-27 06:04:10,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:04:10,334 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:04:10,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:04:10,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:04:10,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:04:10,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:04:10" (1/1) ... [2019-12-27 06:04:10,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7760e6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:10, skipping insertion in model container [2019-12-27 06:04:10,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:04:10" (1/1) ... [2019-12-27 06:04:10,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:04:10,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:04:10,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:04:10,957 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:04:11,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:04:11,104 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:04:11,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:11 WrapperNode [2019-12-27 06:04:11,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:04:11,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:04:11,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:04:11,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:04:11,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:11" (1/1) ... [2019-12-27 06:04:11,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:11" (1/1) ... [2019-12-27 06:04:11,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:04:11,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:04:11,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:04:11,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:04:11,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:11" (1/1) ... [2019-12-27 06:04:11,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:11" (1/1) ... [2019-12-27 06:04:11,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:11" (1/1) ... [2019-12-27 06:04:11,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:11" (1/1) ... [2019-12-27 06:04:11,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:11" (1/1) ... [2019-12-27 06:04:11,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:11" (1/1) ... [2019-12-27 06:04:11,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:11" (1/1) ... [2019-12-27 06:04:11,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:04:11,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:04:11,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:04:11,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:04:11,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:04:11,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:04:11,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:04:11,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:04:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:04:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:04:11,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:04:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:04:11,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:04:11,329 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:04:11,329 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:04:11,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:04:11,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:04:11,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:04:11,331 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:04:12,179 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:04:12,179 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:04:12,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:04:12 BoogieIcfgContainer [2019-12-27 06:04:12,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:04:12,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:04:12,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:04:12,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:04:12,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:04:10" (1/3) ... [2019-12-27 06:04:12,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8431e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:04:12, skipping insertion in model container [2019-12-27 06:04:12,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:04:11" (2/3) ... [2019-12-27 06:04:12,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8431e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:04:12, skipping insertion in model container [2019-12-27 06:04:12,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:04:12" (3/3) ... [2019-12-27 06:04:12,190 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_pso.opt.i [2019-12-27 06:04:12,200 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:04:12,201 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:04:12,209 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:04:12,210 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:04:12,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,251 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,279 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,279 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,279 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,279 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,280 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,286 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,286 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,297 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,297 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,300 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,301 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,301 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,306 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,306 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:04:12,322 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:04:12,343 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:04:12,343 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:04:12,343 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:04:12,343 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:04:12,344 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:04:12,344 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:04:12,344 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:04:12,344 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:04:12,360 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 06:04:12,362 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 06:04:12,466 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 06:04:12,466 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:04:12,482 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:04:12,508 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 06:04:12,561 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 06:04:12,562 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:04:12,569 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:04:12,589 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 06:04:12,590 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:04:15,942 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 06:04:16,070 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 06:04:16,098 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82846 [2019-12-27 06:04:16,098 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 06:04:16,102 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 110 transitions [2019-12-27 06:04:36,684 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 125660 states. [2019-12-27 06:04:36,686 INFO L276 IsEmpty]: Start isEmpty. Operand 125660 states. [2019-12-27 06:04:36,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 06:04:36,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:04:36,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 06:04:36,694 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:04:36,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:04:36,701 INFO L82 PathProgramCache]: Analyzing trace with hash 807924105, now seen corresponding path program 1 times [2019-12-27 06:04:36,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:04:36,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100394604] [2019-12-27 06:04:36,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:04:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:04:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:04:36,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100394604] [2019-12-27 06:04:36,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:04:36,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:04:36,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955816961] [2019-12-27 06:04:36,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:04:36,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:04:36,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:04:36,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:04:36,974 INFO L87 Difference]: Start difference. First operand 125660 states. Second operand 3 states. [2019-12-27 06:04:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:04:40,977 INFO L93 Difference]: Finished difference Result 125096 states and 540334 transitions. [2019-12-27 06:04:40,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:04:40,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 06:04:40,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:04:41,863 INFO L225 Difference]: With dead ends: 125096 [2019-12-27 06:04:41,863 INFO L226 Difference]: Without dead ends: 122548 [2019-12-27 06:04:41,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:04:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122548 states. [2019-12-27 06:04:50,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122548 to 122548. [2019-12-27 06:04:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122548 states. [2019-12-27 06:04:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122548 states to 122548 states and 529960 transitions. [2019-12-27 06:04:51,402 INFO L78 Accepts]: Start accepts. Automaton has 122548 states and 529960 transitions. Word has length 5 [2019-12-27 06:04:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:04:51,403 INFO L462 AbstractCegarLoop]: Abstraction has 122548 states and 529960 transitions. [2019-12-27 06:04:51,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:04:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 122548 states and 529960 transitions. [2019-12-27 06:04:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:04:51,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:04:51,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:04:51,407 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:04:51,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:04:51,407 INFO L82 PathProgramCache]: Analyzing trace with hash 311209173, now seen corresponding path program 1 times [2019-12-27 06:04:51,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:04:51,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263715897] [2019-12-27 06:04:51,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:04:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:04:51,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:04:51,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263715897] [2019-12-27 06:04:51,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:04:51,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:04:51,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645933722] [2019-12-27 06:04:51,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:04:51,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:04:51,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:04:51,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:04:51,558 INFO L87 Difference]: Start difference. First operand 122548 states and 529960 transitions. Second operand 4 states. [2019-12-27 06:04:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:04:57,618 INFO L93 Difference]: Finished difference Result 196578 states and 812188 transitions. [2019-12-27 06:04:57,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:04:57,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:04:57,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:04:58,272 INFO L225 Difference]: With dead ends: 196578 [2019-12-27 06:04:58,273 INFO L226 Difference]: Without dead ends: 196529 [2019-12-27 06:04:58,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:05:04,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196529 states. [2019-12-27 06:05:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196529 to 180333. [2019-12-27 06:05:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180333 states. [2019-12-27 06:05:09,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180333 states to 180333 states and 754389 transitions. [2019-12-27 06:05:09,136 INFO L78 Accepts]: Start accepts. Automaton has 180333 states and 754389 transitions. Word has length 11 [2019-12-27 06:05:09,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:09,136 INFO L462 AbstractCegarLoop]: Abstraction has 180333 states and 754389 transitions. [2019-12-27 06:05:09,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:05:09,137 INFO L276 IsEmpty]: Start isEmpty. Operand 180333 states and 754389 transitions. [2019-12-27 06:05:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:05:09,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:09,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:09,145 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:09,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:09,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1817604182, now seen corresponding path program 1 times [2019-12-27 06:05:09,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:09,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021673827] [2019-12-27 06:05:09,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:09,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021673827] [2019-12-27 06:05:09,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:09,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:05:09,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190687062] [2019-12-27 06:05:09,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:05:09,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:09,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:05:09,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:05:09,243 INFO L87 Difference]: Start difference. First operand 180333 states and 754389 transitions. Second operand 4 states. [2019-12-27 06:05:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:16,734 INFO L93 Difference]: Finished difference Result 255988 states and 1044211 transitions. [2019-12-27 06:05:16,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:05:16,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:05:16,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:18,275 INFO L225 Difference]: With dead ends: 255988 [2019-12-27 06:05:18,275 INFO L226 Difference]: Without dead ends: 255925 [2019-12-27 06:05:18,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:05:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255925 states. [2019-12-27 06:05:33,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255925 to 217043. [2019-12-27 06:05:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217043 states. [2019-12-27 06:05:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217043 states to 217043 states and 900881 transitions. [2019-12-27 06:05:34,953 INFO L78 Accepts]: Start accepts. Automaton has 217043 states and 900881 transitions. Word has length 13 [2019-12-27 06:05:34,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:34,954 INFO L462 AbstractCegarLoop]: Abstraction has 217043 states and 900881 transitions. [2019-12-27 06:05:34,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:05:34,955 INFO L276 IsEmpty]: Start isEmpty. Operand 217043 states and 900881 transitions. [2019-12-27 06:05:34,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:05:34,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:34,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:34,958 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:34,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:34,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1719204338, now seen corresponding path program 1 times [2019-12-27 06:05:34,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:34,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42906126] [2019-12-27 06:05:34,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:35,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42906126] [2019-12-27 06:05:35,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:35,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:05:35,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948592190] [2019-12-27 06:05:35,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:05:35,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:35,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:05:35,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:35,028 INFO L87 Difference]: Start difference. First operand 217043 states and 900881 transitions. Second operand 3 states. [2019-12-27 06:05:35,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:35,221 INFO L93 Difference]: Finished difference Result 41850 states and 136635 transitions. [2019-12-27 06:05:35,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:05:35,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:05:35,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:35,292 INFO L225 Difference]: With dead ends: 41850 [2019-12-27 06:05:35,292 INFO L226 Difference]: Without dead ends: 41850 [2019-12-27 06:05:35,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41850 states. [2019-12-27 06:05:35,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41850 to 41850. [2019-12-27 06:05:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41850 states. [2019-12-27 06:05:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41850 states to 41850 states and 136635 transitions. [2019-12-27 06:05:37,595 INFO L78 Accepts]: Start accepts. Automaton has 41850 states and 136635 transitions. Word has length 13 [2019-12-27 06:05:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:37,596 INFO L462 AbstractCegarLoop]: Abstraction has 41850 states and 136635 transitions. [2019-12-27 06:05:37,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:05:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 41850 states and 136635 transitions. [2019-12-27 06:05:37,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 06:05:37,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:37,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:37,601 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:37,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:37,601 INFO L82 PathProgramCache]: Analyzing trace with hash 565965362, now seen corresponding path program 1 times [2019-12-27 06:05:37,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:37,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858623803] [2019-12-27 06:05:37,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:37,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858623803] [2019-12-27 06:05:37,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:37,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:05:37,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791159124] [2019-12-27 06:05:37,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:05:37,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:37,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:05:37,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:05:37,750 INFO L87 Difference]: Start difference. First operand 41850 states and 136635 transitions. Second operand 6 states. [2019-12-27 06:05:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:38,607 INFO L93 Difference]: Finished difference Result 56420 states and 180098 transitions. [2019-12-27 06:05:38,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:05:38,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-27 06:05:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:38,744 INFO L225 Difference]: With dead ends: 56420 [2019-12-27 06:05:38,744 INFO L226 Difference]: Without dead ends: 56407 [2019-12-27 06:05:38,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:05:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56407 states. [2019-12-27 06:05:39,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56407 to 42107. [2019-12-27 06:05:39,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42107 states. [2019-12-27 06:05:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42107 states to 42107 states and 137336 transitions. [2019-12-27 06:05:39,594 INFO L78 Accepts]: Start accepts. Automaton has 42107 states and 137336 transitions. Word has length 19 [2019-12-27 06:05:39,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:39,595 INFO L462 AbstractCegarLoop]: Abstraction has 42107 states and 137336 transitions. [2019-12-27 06:05:39,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:05:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 42107 states and 137336 transitions. [2019-12-27 06:05:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:05:39,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:39,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:39,608 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:39,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:39,609 INFO L82 PathProgramCache]: Analyzing trace with hash 967390355, now seen corresponding path program 1 times [2019-12-27 06:05:39,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:39,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100055704] [2019-12-27 06:05:39,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:39,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:39,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100055704] [2019-12-27 06:05:39,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:39,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:05:39,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551142131] [2019-12-27 06:05:39,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:05:39,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:39,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:05:39,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:05:39,670 INFO L87 Difference]: Start difference. First operand 42107 states and 137336 transitions. Second operand 4 states. [2019-12-27 06:05:39,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:39,727 INFO L93 Difference]: Finished difference Result 7672 states and 21026 transitions. [2019-12-27 06:05:39,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:05:39,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:05:39,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:39,751 INFO L225 Difference]: With dead ends: 7672 [2019-12-27 06:05:39,751 INFO L226 Difference]: Without dead ends: 7672 [2019-12-27 06:05:39,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:05:42,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7672 states. [2019-12-27 06:05:42,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7672 to 7532. [2019-12-27 06:05:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7532 states. [2019-12-27 06:05:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7532 states to 7532 states and 20626 transitions. [2019-12-27 06:05:42,369 INFO L78 Accepts]: Start accepts. Automaton has 7532 states and 20626 transitions. Word has length 25 [2019-12-27 06:05:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:42,370 INFO L462 AbstractCegarLoop]: Abstraction has 7532 states and 20626 transitions. [2019-12-27 06:05:42,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:05:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 7532 states and 20626 transitions. [2019-12-27 06:05:42,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 06:05:42,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:42,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:42,382 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:42,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:42,382 INFO L82 PathProgramCache]: Analyzing trace with hash 628706666, now seen corresponding path program 1 times [2019-12-27 06:05:42,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:42,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688630895] [2019-12-27 06:05:42,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:42,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688630895] [2019-12-27 06:05:42,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:42,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:05:42,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488753113] [2019-12-27 06:05:42,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:05:42,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:42,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:05:42,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:05:42,460 INFO L87 Difference]: Start difference. First operand 7532 states and 20626 transitions. Second operand 5 states. [2019-12-27 06:05:42,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:42,499 INFO L93 Difference]: Finished difference Result 5403 states and 15530 transitions. [2019-12-27 06:05:42,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:05:42,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 06:05:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:42,510 INFO L225 Difference]: With dead ends: 5403 [2019-12-27 06:05:42,510 INFO L226 Difference]: Without dead ends: 5403 [2019-12-27 06:05:42,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:05:42,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2019-12-27 06:05:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 4990. [2019-12-27 06:05:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4990 states. [2019-12-27 06:05:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4990 states to 4990 states and 14413 transitions. [2019-12-27 06:05:42,615 INFO L78 Accepts]: Start accepts. Automaton has 4990 states and 14413 transitions. Word has length 37 [2019-12-27 06:05:42,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:42,615 INFO L462 AbstractCegarLoop]: Abstraction has 4990 states and 14413 transitions. [2019-12-27 06:05:42,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:05:42,615 INFO L276 IsEmpty]: Start isEmpty. Operand 4990 states and 14413 transitions. [2019-12-27 06:05:42,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:05:42,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:42,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:42,628 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:42,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:42,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2046604178, now seen corresponding path program 1 times [2019-12-27 06:05:42,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:42,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780872637] [2019-12-27 06:05:42,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:42,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780872637] [2019-12-27 06:05:42,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:42,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:05:42,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801252112] [2019-12-27 06:05:42,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:05:42,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:42,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:05:42,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:42,737 INFO L87 Difference]: Start difference. First operand 4990 states and 14413 transitions. Second operand 3 states. [2019-12-27 06:05:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:42,803 INFO L93 Difference]: Finished difference Result 4999 states and 14422 transitions. [2019-12-27 06:05:42,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:05:42,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:05:42,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:42,814 INFO L225 Difference]: With dead ends: 4999 [2019-12-27 06:05:42,815 INFO L226 Difference]: Without dead ends: 4999 [2019-12-27 06:05:42,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4999 states. [2019-12-27 06:05:42,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4999 to 4995. [2019-12-27 06:05:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4995 states. [2019-12-27 06:05:42,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4995 states to 4995 states and 14418 transitions. [2019-12-27 06:05:42,923 INFO L78 Accepts]: Start accepts. Automaton has 4995 states and 14418 transitions. Word has length 65 [2019-12-27 06:05:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:42,924 INFO L462 AbstractCegarLoop]: Abstraction has 4995 states and 14418 transitions. [2019-12-27 06:05:42,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:05:42,924 INFO L276 IsEmpty]: Start isEmpty. Operand 4995 states and 14418 transitions. [2019-12-27 06:05:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:05:42,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:42,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:42,936 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:42,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:42,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1953615188, now seen corresponding path program 1 times [2019-12-27 06:05:42,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:42,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059764397] [2019-12-27 06:05:42,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:43,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059764397] [2019-12-27 06:05:43,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:43,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:05:43,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356628927] [2019-12-27 06:05:43,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:05:43,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:43,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:05:43,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:43,051 INFO L87 Difference]: Start difference. First operand 4995 states and 14418 transitions. Second operand 3 states. [2019-12-27 06:05:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:43,081 INFO L93 Difference]: Finished difference Result 4722 states and 13437 transitions. [2019-12-27 06:05:43,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:05:43,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:05:43,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:43,089 INFO L225 Difference]: With dead ends: 4722 [2019-12-27 06:05:43,089 INFO L226 Difference]: Without dead ends: 4722 [2019-12-27 06:05:43,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4722 states. [2019-12-27 06:05:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4722 to 4722. [2019-12-27 06:05:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4722 states. [2019-12-27 06:05:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4722 states to 4722 states and 13437 transitions. [2019-12-27 06:05:43,163 INFO L78 Accepts]: Start accepts. Automaton has 4722 states and 13437 transitions. Word has length 65 [2019-12-27 06:05:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:43,163 INFO L462 AbstractCegarLoop]: Abstraction has 4722 states and 13437 transitions. [2019-12-27 06:05:43,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:05:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4722 states and 13437 transitions. [2019-12-27 06:05:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:05:43,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:43,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:43,171 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:43,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:43,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1120597844, now seen corresponding path program 1 times [2019-12-27 06:05:43,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:43,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759967274] [2019-12-27 06:05:43,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:43,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759967274] [2019-12-27 06:05:43,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:43,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:05:43,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085583066] [2019-12-27 06:05:43,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:05:43,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:43,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:05:43,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:05:43,287 INFO L87 Difference]: Start difference. First operand 4722 states and 13437 transitions. Second operand 5 states. [2019-12-27 06:05:43,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:43,630 INFO L93 Difference]: Finished difference Result 7520 states and 21156 transitions. [2019-12-27 06:05:43,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:05:43,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 06:05:43,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:43,641 INFO L225 Difference]: With dead ends: 7520 [2019-12-27 06:05:43,641 INFO L226 Difference]: Without dead ends: 7520 [2019-12-27 06:05:43,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:05:43,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7520 states. [2019-12-27 06:05:43,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7520 to 5173. [2019-12-27 06:05:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5173 states. [2019-12-27 06:05:43,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 14786 transitions. [2019-12-27 06:05:43,726 INFO L78 Accepts]: Start accepts. Automaton has 5173 states and 14786 transitions. Word has length 66 [2019-12-27 06:05:43,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:43,726 INFO L462 AbstractCegarLoop]: Abstraction has 5173 states and 14786 transitions. [2019-12-27 06:05:43,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:05:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 5173 states and 14786 transitions. [2019-12-27 06:05:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:05:43,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:43,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:43,734 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:43,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:43,734 INFO L82 PathProgramCache]: Analyzing trace with hash 479418910, now seen corresponding path program 2 times [2019-12-27 06:05:43,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:43,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84701861] [2019-12-27 06:05:43,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:43,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84701861] [2019-12-27 06:05:43,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:43,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:05:43,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231695588] [2019-12-27 06:05:43,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:05:43,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:43,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:05:43,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:05:43,831 INFO L87 Difference]: Start difference. First operand 5173 states and 14786 transitions. Second operand 5 states. [2019-12-27 06:05:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:44,151 INFO L93 Difference]: Finished difference Result 7510 states and 21285 transitions. [2019-12-27 06:05:44,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:05:44,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 06:05:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:44,164 INFO L225 Difference]: With dead ends: 7510 [2019-12-27 06:05:44,164 INFO L226 Difference]: Without dead ends: 7510 [2019-12-27 06:05:44,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:05:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7510 states. [2019-12-27 06:05:44,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7510 to 6136. [2019-12-27 06:05:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6136 states. [2019-12-27 06:05:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6136 states to 6136 states and 17564 transitions. [2019-12-27 06:05:44,318 INFO L78 Accepts]: Start accepts. Automaton has 6136 states and 17564 transitions. Word has length 66 [2019-12-27 06:05:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:44,319 INFO L462 AbstractCegarLoop]: Abstraction has 6136 states and 17564 transitions. [2019-12-27 06:05:44,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:05:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 6136 states and 17564 transitions. [2019-12-27 06:05:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:05:44,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:44,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:44,333 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:44,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:44,333 INFO L82 PathProgramCache]: Analyzing trace with hash -892162030, now seen corresponding path program 3 times [2019-12-27 06:05:44,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:44,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720698967] [2019-12-27 06:05:44,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:44,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720698967] [2019-12-27 06:05:44,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:44,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:05:44,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563043682] [2019-12-27 06:05:44,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:05:44,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:44,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:05:44,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:05:44,461 INFO L87 Difference]: Start difference. First operand 6136 states and 17564 transitions. Second operand 6 states. [2019-12-27 06:05:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:44,960 INFO L93 Difference]: Finished difference Result 8622 states and 24325 transitions. [2019-12-27 06:05:44,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:05:44,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 06:05:44,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:44,974 INFO L225 Difference]: With dead ends: 8622 [2019-12-27 06:05:44,974 INFO L226 Difference]: Without dead ends: 8622 [2019-12-27 06:05:44,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:05:45,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8622 states. [2019-12-27 06:05:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8622 to 6591. [2019-12-27 06:05:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6591 states. [2019-12-27 06:05:45,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6591 states to 6591 states and 18843 transitions. [2019-12-27 06:05:45,115 INFO L78 Accepts]: Start accepts. Automaton has 6591 states and 18843 transitions. Word has length 66 [2019-12-27 06:05:45,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:45,116 INFO L462 AbstractCegarLoop]: Abstraction has 6591 states and 18843 transitions. [2019-12-27 06:05:45,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:05:45,116 INFO L276 IsEmpty]: Start isEmpty. Operand 6591 states and 18843 transitions. [2019-12-27 06:05:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:05:45,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:45,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:45,125 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:45,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:45,126 INFO L82 PathProgramCache]: Analyzing trace with hash 357247128, now seen corresponding path program 4 times [2019-12-27 06:05:45,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:45,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024119493] [2019-12-27 06:05:45,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:45,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024119493] [2019-12-27 06:05:45,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:45,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:05:45,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803887410] [2019-12-27 06:05:45,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:05:45,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:45,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:05:45,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:45,208 INFO L87 Difference]: Start difference. First operand 6591 states and 18843 transitions. Second operand 3 states. [2019-12-27 06:05:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:45,279 INFO L93 Difference]: Finished difference Result 6591 states and 18842 transitions. [2019-12-27 06:05:45,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:05:45,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:05:45,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:45,289 INFO L225 Difference]: With dead ends: 6591 [2019-12-27 06:05:45,290 INFO L226 Difference]: Without dead ends: 6591 [2019-12-27 06:05:45,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6591 states. [2019-12-27 06:05:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6591 to 3736. [2019-12-27 06:05:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3736 states. [2019-12-27 06:05:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 10875 transitions. [2019-12-27 06:05:45,392 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 10875 transitions. Word has length 66 [2019-12-27 06:05:45,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:45,485 INFO L462 AbstractCegarLoop]: Abstraction has 3736 states and 10875 transitions. [2019-12-27 06:05:45,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:05:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 10875 transitions. [2019-12-27 06:05:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:05:45,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:45,494 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:45,495 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:45,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:45,495 INFO L82 PathProgramCache]: Analyzing trace with hash -104691858, now seen corresponding path program 1 times [2019-12-27 06:05:45,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:45,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489243668] [2019-12-27 06:05:45,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:45,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489243668] [2019-12-27 06:05:45,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:45,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:05:45,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665524753] [2019-12-27 06:05:45,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:05:45,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:45,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:05:45,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:45,579 INFO L87 Difference]: Start difference. First operand 3736 states and 10875 transitions. Second operand 3 states. [2019-12-27 06:05:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:45,611 INFO L93 Difference]: Finished difference Result 3560 states and 10079 transitions. [2019-12-27 06:05:45,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:05:45,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 06:05:45,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:45,617 INFO L225 Difference]: With dead ends: 3560 [2019-12-27 06:05:45,618 INFO L226 Difference]: Without dead ends: 3560 [2019-12-27 06:05:45,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:05:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2019-12-27 06:05:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 3184. [2019-12-27 06:05:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3184 states. [2019-12-27 06:05:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 9015 transitions. [2019-12-27 06:05:45,696 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 9015 transitions. Word has length 67 [2019-12-27 06:05:45,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:45,696 INFO L462 AbstractCegarLoop]: Abstraction has 3184 states and 9015 transitions. [2019-12-27 06:05:45,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:05:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 9015 transitions. [2019-12-27 06:05:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 06:05:45,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:45,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:45,702 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:45,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:45,703 INFO L82 PathProgramCache]: Analyzing trace with hash 567215771, now seen corresponding path program 1 times [2019-12-27 06:05:45,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:45,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469614818] [2019-12-27 06:05:45,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:45,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469614818] [2019-12-27 06:05:45,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:45,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:05:45,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634078529] [2019-12-27 06:05:45,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:05:45,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:45,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:05:45,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:05:45,840 INFO L87 Difference]: Start difference. First operand 3184 states and 9015 transitions. Second operand 6 states. [2019-12-27 06:05:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:45,955 INFO L93 Difference]: Finished difference Result 5732 states and 16229 transitions. [2019-12-27 06:05:45,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:05:45,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 06:05:45,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:45,960 INFO L225 Difference]: With dead ends: 5732 [2019-12-27 06:05:45,960 INFO L226 Difference]: Without dead ends: 3075 [2019-12-27 06:05:45,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:05:45,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2019-12-27 06:05:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2643. [2019-12-27 06:05:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2643 states. [2019-12-27 06:05:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 7431 transitions. [2019-12-27 06:05:46,038 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 7431 transitions. Word has length 68 [2019-12-27 06:05:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:46,039 INFO L462 AbstractCegarLoop]: Abstraction has 2643 states and 7431 transitions. [2019-12-27 06:05:46,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:05:46,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 7431 transitions. [2019-12-27 06:05:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 06:05:46,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:46,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:46,046 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:46,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:46,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1899721119, now seen corresponding path program 2 times [2019-12-27 06:05:46,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:46,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694349768] [2019-12-27 06:05:46,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:05:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:05:46,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694349768] [2019-12-27 06:05:46,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:05:46,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:05:46,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054778335] [2019-12-27 06:05:46,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:05:46,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:05:46,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:05:46,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:05:46,403 INFO L87 Difference]: Start difference. First operand 2643 states and 7431 transitions. Second operand 13 states. [2019-12-27 06:05:47,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:05:47,408 INFO L93 Difference]: Finished difference Result 8456 states and 23710 transitions. [2019-12-27 06:05:47,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:05:47,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-27 06:05:47,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:05:47,413 INFO L225 Difference]: With dead ends: 8456 [2019-12-27 06:05:47,413 INFO L226 Difference]: Without dead ends: 2360 [2019-12-27 06:05:47,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:05:47,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2019-12-27 06:05:47,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 1964. [2019-12-27 06:05:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-12-27 06:05:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 5462 transitions. [2019-12-27 06:05:47,447 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 5462 transitions. Word has length 68 [2019-12-27 06:05:47,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:05:47,447 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 5462 transitions. [2019-12-27 06:05:47,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:05:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 5462 transitions. [2019-12-27 06:05:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 06:05:47,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:05:47,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:05:47,450 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:05:47,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:05:47,451 INFO L82 PathProgramCache]: Analyzing trace with hash -149569657, now seen corresponding path program 3 times [2019-12-27 06:05:47,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:05:47,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322638752] [2019-12-27 06:05:47,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:05:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:05:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:05:47,569 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:05:47,569 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:05:47,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= 0 v_~x$w_buff1~0_28) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~x$flush_delayed~0_15 0) (= 0 v_~x$r_buff0_thd1~0_20) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t754~0.base_20| 1)) (= v_~main$tmp_guard1~0_11 0) (= 0 |v_ULTIMATE.start_main_~#t754~0.offset_17|) (= v_~main$tmp_guard0~0_8 0) (= 0 v_~x$r_buff0_thd0~0_78) (< 0 |v_#StackHeapBarrier_17|) (= v_~x~0_29 0) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_18 0) (= v_~y~0_12 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t754~0.base_20|)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t754~0.base_20|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~__unbuffered_cnt~0_19) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$w_buff1_used~0_72 0) (= v_~x$r_buff1_thd0~0_46 0) (= v_~__unbuffered_p2_EBX~0_8 0) (= |v_#NULL.offset_5| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t754~0.base_20| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t754~0.base_20|) |v_ULTIMATE.start_main_~#t754~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~z~0_9) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$w_buff0_used~0_118) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t754~0.base_20| 4)) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0~0_30) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ~x$w_buff0~0=v_~x$w_buff0~0_30, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_~#t754~0.offset=|v_ULTIMATE.start_main_~#t754~0.offset_17|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ULTIMATE.start_main_~#t754~0.base=|v_ULTIMATE.start_main_~#t754~0.base_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~x$w_buff1~0=v_~x$w_buff1~0_28, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_~#t756~0.offset=|v_ULTIMATE.start_main_~#t756~0.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_29, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_~#t755~0.offset=|v_ULTIMATE.start_main_~#t755~0.offset_17|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~y~0=v_~y~0_12, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_~#t756~0.base=|v_ULTIMATE.start_main_~#t756~0.base_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_46, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118, ULTIMATE.start_main_~#t755~0.base=|v_ULTIMATE.start_main_~#t755~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t754~0.offset, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t754~0.base, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t756~0.offset, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t755~0.offset, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t756~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t755~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 06:05:47,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L810-1-->L812: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t755~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t755~0.base_13|) |v_ULTIMATE.start_main_~#t755~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t755~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t755~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t755~0.base_13|) (= |v_ULTIMATE.start_main_~#t755~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t755~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t755~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t755~0.base=|v_ULTIMATE.start_main_~#t755~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t755~0.offset=|v_ULTIMATE.start_main_~#t755~0.offset_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t755~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t755~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 06:05:47,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L812-1-->L814: Formula: (and (= |v_ULTIMATE.start_main_~#t756~0.offset_11| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t756~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t756~0.base_13|) |v_ULTIMATE.start_main_~#t756~0.offset_11| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t756~0.base_13| 0)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t756~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t756~0.base_13|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t756~0.base_13| 1) |v_#valid_34|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t756~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t756~0.base=|v_ULTIMATE.start_main_~#t756~0.base_13|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t756~0.offset=|v_ULTIMATE.start_main_~#t756~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t756~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t756~0.offset, #length] because there is no mapped edge [2019-12-27 06:05:47,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_62 v_~x$w_buff0_used~0_105) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= v_~x$w_buff0~0_19 v_~x$w_buff1~0_20) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= 1 v_~x$w_buff0_used~0_104) (= (mod v_~x$w_buff1_used~0_62 256) 0) (= 2 v_~x$w_buff0~0_18) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~x$w_buff1~0=v_~x$w_buff1~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 06:05:47,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L787-2-->L787-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1483322371 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1483322371 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out1483322371| ~x~0_In1483322371) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out1483322371| ~x$w_buff1~0_In1483322371) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1483322371, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1483322371, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1483322371, ~x~0=~x~0_In1483322371} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1483322371|, ~x$w_buff1~0=~x$w_buff1~0_In1483322371, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1483322371, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1483322371, ~x~0=~x~0_In1483322371} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 06:05:47,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L787-4-->L788: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_19) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 06:05:47,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L735-2-->L735-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out39570216| |P0Thread1of1ForFork0_#t~ite4_Out39570216|)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In39570216 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In39570216 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out39570216| ~x$w_buff1~0_In39570216) (not .cse1) .cse2) (and (= |P0Thread1of1ForFork0_#t~ite3_Out39570216| ~x~0_In39570216) .cse2 (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In39570216, ~x$w_buff1_used~0=~x$w_buff1_used~0_In39570216, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In39570216, ~x~0=~x~0_In39570216} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out39570216|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out39570216|, ~x$w_buff1~0=~x$w_buff1~0_In39570216, ~x$w_buff1_used~0=~x$w_buff1_used~0_In39570216, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In39570216, ~x~0=~x~0_In39570216} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 06:05:47,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1234491302 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1234491302 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1234491302| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1234491302 |P0Thread1of1ForFork0_#t~ite5_Out-1234491302|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1234491302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1234491302} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1234491302|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1234491302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1234491302} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:05:47,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In401951673 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In401951673 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out401951673| 0)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out401951673| ~x$w_buff0_used~0_In401951673) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In401951673, ~x$w_buff0_used~0=~x$w_buff0_used~0_In401951673} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In401951673, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out401951673|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In401951673} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 06:05:47,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In778573297 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In778573297 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In778573297 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In778573297 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out778573297| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite18_Out778573297| ~x$w_buff1_used~0_In778573297)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In778573297, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In778573297, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In778573297, ~x$w_buff0_used~0=~x$w_buff0_used~0_In778573297} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In778573297, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In778573297, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In778573297, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out778573297|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In778573297} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 06:05:47,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1089963566 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1089963566 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1089963566 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In1089963566 256) 0))) (or (and (= ~x$w_buff1_used~0_In1089963566 |P0Thread1of1ForFork0_#t~ite6_Out1089963566|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1089963566|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1089963566, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1089963566, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1089963566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1089963566} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1089963566|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1089963566, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1089963566, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1089963566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1089963566} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:05:47,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2133971366 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In2133971366 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In2133971366 |P2Thread1of1ForFork2_#t~ite19_Out2133971366|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out2133971366|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2133971366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133971366} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2133971366, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out2133971366|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133971366} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 06:05:47,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1028307011 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1028307011 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1028307011 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1028307011 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out-1028307011| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite20_Out-1028307011| ~x$r_buff1_thd3~0_In-1028307011)))) InVars {~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1028307011, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1028307011, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1028307011, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1028307011} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1028307011|, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1028307011, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1028307011, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1028307011, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1028307011} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 06:05:47,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L791-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_12) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 06:05:47,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In826488740 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In826488740 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In826488740 |P1Thread1of1ForFork1_#t~ite11_Out826488740|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out826488740| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In826488740, ~x$w_buff0_used~0=~x$w_buff0_used~0_In826488740} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out826488740|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In826488740, ~x$w_buff0_used~0=~x$w_buff0_used~0_In826488740} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 06:05:47,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In318491400 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In318491400 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In318491400 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In318491400 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out318491400| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In318491400 |P1Thread1of1ForFork1_#t~ite12_Out318491400|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In318491400, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In318491400, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In318491400, ~x$w_buff0_used~0=~x$w_buff0_used~0_In318491400} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In318491400, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In318491400, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out318491400|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In318491400, ~x$w_buff0_used~0=~x$w_buff0_used~0_In318491400} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:05:47,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L767-->L768: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1550541964 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1550541964 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-1550541964 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_Out-1550541964 ~x$r_buff0_thd2~0_In-1550541964)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1550541964, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1550541964} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1550541964|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1550541964, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1550541964} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 06:05:47,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In842888172 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In842888172 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In842888172 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In842888172 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In842888172 |P1Thread1of1ForFork1_#t~ite14_Out842888172|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out842888172|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In842888172, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In842888172, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In842888172, ~x$w_buff0_used~0=~x$w_buff0_used~0_In842888172} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In842888172, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In842888172, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In842888172, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out842888172|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In842888172} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:05:47,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:05:47,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L738-->L738-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1592570926 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1592570926 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out1592570926| ~x$r_buff0_thd1~0_In1592570926) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out1592570926| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1592570926, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1592570926} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1592570926, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1592570926|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1592570926} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 06:05:47,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-219674717 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-219674717 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-219674717 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-219674717 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-219674717| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-219674717| ~x$r_buff1_thd1~0_In-219674717) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-219674717, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-219674717, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-219674717, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-219674717} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-219674717, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-219674717|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-219674717, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-219674717, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-219674717} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:05:47,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 06:05:47,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L820: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:05:47,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L820-2-->L820-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite24_Out1109748733| |ULTIMATE.start_main_#t~ite25_Out1109748733|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1109748733 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1109748733 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite24_Out1109748733| ~x~0_In1109748733)) (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite24_Out1109748733| ~x$w_buff1~0_In1109748733)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1109748733, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1109748733, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1109748733, ~x~0=~x~0_In1109748733} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1109748733, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1109748733|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1109748733|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1109748733, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1109748733, ~x~0=~x~0_In1109748733} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 06:05:47,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-383352851 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-383352851 256)))) (or (and (= ~x$w_buff0_used~0_In-383352851 |ULTIMATE.start_main_#t~ite26_Out-383352851|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out-383352851| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-383352851, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-383352851} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-383352851, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-383352851|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-383352851} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 06:05:47,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1565632580 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1565632580 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1565632580 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1565632580 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out1565632580| 0)) (and (= |ULTIMATE.start_main_#t~ite27_Out1565632580| ~x$w_buff1_used~0_In1565632580) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1565632580, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1565632580, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1565632580, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1565632580} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1565632580, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1565632580, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1565632580|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1565632580, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1565632580} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 06:05:47,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-174411770 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-174411770 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-174411770 |ULTIMATE.start_main_#t~ite28_Out-174411770|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite28_Out-174411770|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-174411770, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-174411770} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-174411770, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-174411770|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-174411770} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 06:05:47,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2088133130 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-2088133130 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2088133130 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-2088133130 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out-2088133130| ~x$r_buff1_thd0~0_In-2088133130)) (and (= |ULTIMATE.start_main_#t~ite29_Out-2088133130| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2088133130, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2088133130, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2088133130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2088133130} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2088133130, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-2088133130|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2088133130, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2088133130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2088133130} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 06:05:47,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L836-->L837: Formula: (and (= v_~x$r_buff0_thd0~0_59 v_~x$r_buff0_thd0~0_58) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:05:47,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L839-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$flush_delayed~0_10 0) (= v_~x$mem_tmp~0_7 v_~x~0_25)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:05:47,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:05:47,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:05:47 BasicIcfg [2019-12-27 06:05:47,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:05:47,719 INFO L168 Benchmark]: Toolchain (without parser) took 97385.01 ms. Allocated memory was 145.8 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.9 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 871.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:05:47,723 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 06:05:47,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.16 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.5 MB in the beginning and 155.6 MB in the end (delta: -55.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:05:47,726 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.91 ms. Allocated memory is still 203.4 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:05:47,726 INFO L168 Benchmark]: Boogie Preprocessor took 43.98 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:05:47,728 INFO L168 Benchmark]: RCFGBuilder took 947.04 ms. Allocated memory is still 203.4 MB. Free memory was 150.3 MB in the beginning and 100.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:05:47,729 INFO L168 Benchmark]: TraceAbstraction took 95534.86 ms. Allocated memory was 203.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.9 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 812.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:05:47,738 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.20 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.16 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.5 MB in the beginning and 155.6 MB in the end (delta: -55.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.91 ms. Allocated memory is still 203.4 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.98 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 947.04 ms. Allocated memory is still 203.4 MB. Free memory was 150.3 MB in the beginning and 100.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 95534.86 ms. Allocated memory was 203.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.9 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 812.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 175 ProgramPointsBefore, 97 ProgramPointsAfterwards, 212 TransitionsBefore, 110 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 28 ChoiceCompositions, 5221 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82846 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t754, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t755, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t756, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L754] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L755] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L756] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L757] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L758] 2 x$r_buff0_thd2 = (_Bool)1 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L789] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L820] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L821] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L822] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L823] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L824] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L832] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L833] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L834] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L834] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L835] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L837] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 95.2s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 24.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2469 SDtfs, 2075 SDslu, 4608 SDs, 0 SdLazy, 2497 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 25 SyntacticMatches, 16 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217043occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 43.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 79746 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 788 NumberOfCodeBlocks, 788 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 704 ConstructedInterpolants, 0 QuantifiedInterpolants, 129372 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...